Register allocation by proof transformation

Ohori, Atsushi

doi:10.1016/j.scico.2004.01.005

Cited by 8 publications

(5 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We adopt the idea underlying the logical interpretation of machine code [22,23] and define the type system as a set of rules of the form Å Ä ½ Å Ä ¾ Á representing the fact that the static semantics of Á is to change the (static) status of the set of live variables from ¾ to ½.…”

Section: ð ³ ðmentioning

confidence: 99%

“…Several papers [11,2,6] discussed correspondences between SSA form and restricted form of functional languages (CPS and Anormal forms.) Since the logical interpretation [22,23] on which our type system is roughly based, is shown to be equivalent to the type system of the lambda calculus, our SSA typing could be used to extend these results to typed calculi.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A type system equivalent to static single assignment

Matsuno

Ohori

2006

Proceedings of the 8th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming

Self Cite

View full text Add to dashboard Cite

This paper develops a static type system equivalent to static single assignment (SSA) form. In this type system, a type of a variable at some program point represents the control flows from the assignment statements that reach the program point. For this type system, we show that a derivable typing of a program corresponds to the program in SSA form. By this result, any SSA transformation can be interpreted as a type inference process in our type system. By adopting a result on efficient SSA transformation, we develop a type inference algorithm that reconstructs a type annotated code from a given code. These results provide a static alternative to SSA based compiler optimization without performing code transformation. Since this process does not change the code, it does not incur overhead due to insertion of functions. Another advantage of this type based approach is that it is not constrained to naming mechanism of variables and can therefore be combined with other static properties useful for compilation and code optimization such as liveness information of variables. As an application, we express optimizations as type-directed code transformations.

show abstract

Section: ð ³ ðmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

A type system equivalent to static single assignment

Matsuno

Ohori

2006

Proceedings of the 8th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…These observation suggest that, in practice, there seems a room to improve the constant factor drastically by demand-driven computation and other program transformation techniques, which are available for functional programs. For instance, Ohori proposed another register allocation by proof transformation on a typed assembly language, which reduces the number of candidates of optimal register allocations [22]. The combination with such methods would be worth exploring.…”

Section: Related Workmentioning

confidence: 99%

Iterative-free program analysis

2003

View full text Add to dashboard Cite

Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed point is commonly computed through an iterative procedure that repeats tracing until convergence. This paper proposes a new method to analyze programs through recursive graph traversals instead of iterative procedures, based on the fact that most programs (without spaghetti GOTO) have wellstructured control flow graphs, graphs with bounded tree width. Our main techniques are; an algebraic construction of a control flow graph, called SP Term, which enables control flow analysis to be defined in a natural recursive form, and the Optimization Theorem, which enables us to compute optimal solution by dynamic programming. We illustrate our method with two examples; dead code detection and register allocation. Different from the traditional standard iterative solution, our dead code detection is described as a simple combination of bottom-up and top-down traversals on SP Term. Register allocation is more interesting, as it further requires optimality of the result. We show how the Optimization Theorem on SP Terms works to find an optimal register allocation as a certain dynamic programming.

show abstract

“…For example, CPS can faithfully represent join points in control flow (Kennedy, 2007), whereas direct style can use arbitrary transformations expressed in terms of the original program (Peyton Jones et al, 2001). Finally, the sequent calculus can also be interpreted as an even lower-level, machine-like language for functional programs (Ohori, 1999), which can be used to reason about fine details like manual memory management (Ohori, 2003). Therefore, the computational interpretation of the sequent calculus acts like a beacon illuminating murky areas in both the design and implementation of functional languages.…”

Section: Introductionmentioning

confidence: 99%

A tutorial on computational classical logic and the sequent calculus

Downen¹,

Ariola²

2018

J. Funct. Prog.

View full text Add to dashboard Cite

We present a model of computation that heavily emphasizes the concept of duality and the interaction between opposites–production interacts with consumption. The symmetry of this framework naturally explains more complicated features of programming languages through relatively familiar concepts. For example, binding a value to a variable is dual to manipulating the flow of control in a program. By looking at the computational interpretation of the sequent calculus, we find a language that lets us speak about duality, control flow, and evaluation order in programs as first-class concepts.We begin by reviewing Gentzen's LK sequent calculus and show how the Curry–Howard isomorphism still applies to give us a different basis for expressing computation. We then illustrate how the fundamental dilemma of computation in the sequent calculus gives rise to a duality between evaluation strategies: strict languages are dual to lazy languages. Finally, we discuss how the concept of focusing, developed in the setting of proof search, is related to the idea of type safety for computation expressed in the sequent calculus. In this regard, we compare and contrast two different methods of focusing that have appeared in the literature, static and dynamic focusing, and illustrate how they are two means to the same end.

show abstract

Register allocation by proof transformation

Cited by 8 publications

References 17 publications

A type system equivalent to static single assignment

A type system equivalent to static single assignment

Iterative-free program analysis

A tutorial on computational classical logic and the sequent calculus

Contact Info

Product

Resources

About