From Specification to Optimisation: An Architecture for Optimisation of Java Bytecode

Authors:
Richard Warburton;Sara Kalvala
Affiliations:
University of Warwick, Coventry, UK;University of Warwick, Coventry, UK
Venue:
CC '09 Proceedings of the 18th International Conference on Compiler Construction: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Year:
2009

Citing 15
Cited 3

Generating data flow analysis algorithms from modal specifications

TACS'91 Selected papers of the conference on Theoretical aspects of computer software
Data flow analysis is model checking of abstract interpretations

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Advanced compiler design and implementation

Advanced compiler design and implementation
Proving correctness of compiler optimizations by temporal logic

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
DFA&OPT-METAFrame: A Tool Kit for Program Analysis and Optimazation

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Optimizing Java Bytecode Using the Soot Framework: Is It Feasible?

CC '00 Proceedings of the 9th International Conference on Compiler Construction
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Points-to analysis using BDDs

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Automatically proving the correctness of compiler optimizations

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Soot - a Java bytecode optimization framework

CASCON '99 Proceedings of the 1999 conference of the Centre for Advanced Studies on Collaborative research
Jedd: a BDD-based relational extension of Java

Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Automated soundness proofs for dataflow analyses and transformations via local rules

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A PVS Based Framework for Validating Compiler Optimizations

SEFM '06 Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods
Compilers: Principles, Techniques, and Tools (2nd Edition)

Compilers: Principles, Techniques, and Tools (2nd Edition)
Context-Sensitive points-to analysis: is it worth it?

CC'06 Proceedings of the 15th international conference on Compiler Construction

Architecture optimisation with Currawong

Proceedings of the first ACM asia-pacific workshop on Workshop on systems
Architecture optimisation with currawong

ACM SIGCOMM Computer Communication Review
A formal approach to fixing bugs

SBMF'11 Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the architecture of the Rosser toolkit that allows optimisations to be specified in a domain specific language, then compiled and deployed towards optimising object programs. The optimisers generated by Rosser exploit model checking to apply dataflow analysis to programs to find optimising opportunities. The transformational language is derived from a formal basis and consequently can be proved sound. We validate the technique by comparing the application of optimisers generated by our system against hand-written optimisations using the Java based Scimark 2.0 benchmark.