Marmot: an optimizing compiler for Java
- 23 March 2000
- journal article
- research article
- Published by Wiley in Software: Practice and Experience
- Vol. 30 (3) , 199-232
- https://doi.org/10.1002/(SICI)1097-024X(200003)30:3%3C199::AID-SPE296%3E3.0.CO;2-2
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Incremental computation of static single assignment formPublished by Springer Nature ,1996
- A reexamination of “Optimization of array subscript range checks”ACM Transactions on Programming Languages and Systems, 1995
- Improvements to graph coloring register allocationACM Transactions on Programming Languages and Systems, 1994
- Optimizing array bound checks using flow analysisACM Letters on Programming Languages and Systems, 1993
- Optimization of array subscript range checksACM Letters on Programming Languages and Systems, 1992
- Profile‐guided automatic inline expansion for C programsSoftware: Practice and Experience, 1992
- Register allocation via coloringComputer Languages, 1981
- A fast algorithm for finding dominators in a flowgraphACM Transactions on Programming Languages and Systems, 1979
- Fourier-Motzkin elimination extension to integer programming problemsJournal of Combinatorial Theory, Series A, 1976
- Fourier-Motzkin elimination and its dualJournal of Combinatorial Theory, Series A, 1973