Register Allocation by Proof Transformation (2004)
by
Atsushi Ohori Japan
,
Atsushi Ohori
Science of Computer Programming
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Japan04registerallocation,
author = {Atsushi Ohori Japan and Atsushi Ohori},
title = {Register Allocation by Proof Transformation},
booktitle = {Science of Computer Programming},
year = {2004},
pages = {1--3}
}
author = {Atsushi Ohori Japan and Atsushi Ohori},
title = {Register Allocation by Proof Transformation},
booktitle = {Science of Computer Programming},
year = {2004},
pages = {1--3}
}
Bookmarks
OpenURL
Abstract:
This paper presents a proof-theoretical framework for register allocation that accounts for the entire process of register allocation.
Citations
| 869 | Proof-carrying code – Necula - 1997 |
| 500 | From System F to Typed Assembly Language – Morrisett, Walker, et al. |
| 359 | Register allocation & spilling via graph coloring – Chaitin - 1982 |
| 168 | A type system for Java bytecode subroutines – Abadi, Stata - 1998 |
| 132 | Improvements to graph coloring register allocation – Briggs, Cooper, et al. - 1994 |
| 116 | Typechecking records and variants in a natural extension of ML – Rémy - 1989 |
| 85 | Linear scan register allocation – Poletto, Sarkar - 1999 |
| 65 | A polymorphic record calculus and its compilation – Ohori - 1995 |
| 47 | Logics without the contraction rule – Ono, Kormori - 1985 |
| 33 | Register allocation via coloring. Computer Languages – Chaitin, Auslander, et al. - 1981 |
| 10 | The logical abstract machine: a Curry-Howard isomorphism for machine code – Ohori - 1999 |
| 5 | Types for register allocation – Agat - 1998 |
