Verifying data flow optimizations for just-in-time compilation

Authors:
Vivek Haldar
Affiliations:
Sun Microsystems Laboratories, Mountain View, CA
Venue:
Verifying data flow optimizations for just-in-time compilation
Year:
2002

Citing 5
Cited 1

Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Advanced compiler design and implementation

Advanced compiler design and implementation
SafeTSA: a type safe and referentially secure mobile-code representation based on static single assignment form

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Using annotations to reduce dynamic optimization time

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
The source is the proof

Proceedings of the 2002 workshop on New security paradigms

Efficient incremental information flow control with nested control regions

Proceedings of the 1st ACM SIGPLAN international workshop on Programming language and systems technologies for internet clients

Quantified Score

Hi-index	0.00

Visualization

Abstract

Annotations are often added to mobile code to reduce the optimization burden of just-in- time compilers. However, these annotations are not checked for correctness and must be trusted--incorrect or malicious annotations could lead to the generation of incorrect or insecure code. We present a time- and space efficient method for verifying the results of the large class of data flow optimizations. This allows the safe movement of computation- intensive optimizations away from the code consumer towards the code producer.