A Java Supercompiler and Its Application to Verification of Cache-Coherence Protocols

Klimov, Andrei

doi:10.1007/978-3-642-11486-1_16

Cited by 13 publications

(7 citation statements)

References 21 publications

(29 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Despite their automatic nature, most partial evaluators also provide annotations to guide specialization decisions. Some notable systems include DyC [Grant et al 2000], an annotationdirected specializer for C, JSpec/Tempo [Schultz et al 2003], the JSC Java Supercompiler [Klimov 2009], and Civet [Shali and Cook 2011].…”

Section: Related Workmentioning

confidence: 99%

Collapsing towers of interpreters

Amin

Rompf

2017

Proc. ACM Program. Lang.

View full text Add to dashboard Buy / Rent full text

Given a tower of interpreters, i.e., a sequence of multiple interpreters interpreting one another as input programs, we aim to collapse this tower into a compiler that removes all interpretive overhead and runs in a single pass. In the real world, a use case might be Python code executed by an x86 runtime, on a CPU emulated in a JavaScript VM, running on an ARM CPU. Collapsing such a tower can not only exponentially improve runtime performance, but also enable the use of base-language tools for interpreted programs, e.g., for analysis and verification. In this paper, we lay the foundations in an idealized but realistic setting. We present a multi-level lambda calculus that features staging constructs and stage polymorphism: based on runtime parameters, an evaluator either executes source code (thereby acting as an interpreter) or generates code (thereby acting as a compiler). We identify stage polymorphism, a programming model from the domain of high-performance program generators, as the key mechanism to make such interpreters compose in a collapsible way. We present Pink, a meta-circular Lisp-like evaluator on top of this calculus, and demonstrate that we can collapse arbitrarily many levels of self-interpretation, including levels with semantic modifications. We discuss several examples: compiling regular expressions through an interpreter to base code, building program transformers from modified interpreters, and others. We develop these ideas further to include reflection and reification, culminating in Purple, a reflective language inspired by Brown, Blond, and Black, which realizes a conceptually infinite tower, where every aspect of the semantics can change dynamically. Addressing an open challenge, we show how user programs can be compiled and recompiled under user-modified semantics.

show abstract

Section: Related Workmentioning

confidence: 99%

Collapsing towers of interpreters

Amin

Rompf

2017

Proc. ACM Program. Lang.

View full text Add to dashboard Buy / Rent full text

show abstract

“…Partial evaluation [35] is an automatic program specialization technique. Some notable systems include DyC [27] for C, JSpec/Tempo [68], the JSC Java Supercompiler [39], and Civet [69] for Java. Lancet [64] is a partial evaluator for Java bytecode built on top of LMS.…”

Section: Related Workmentioning

confidence: 99%

Reflections on LMS: exploring front-end alternatives

Rompf

2016

Proceedings of the 2016 7th ACM SIGPLAN Symposium on Scala

View full text Add to dashboard Buy / Rent full text

Metaprogramming techniques to generate code at runtime in a general-purpose meta-language have seen a surge of interest in recent years, driven by the widening performance gap between high-level languages and emerging hardware platforms. In the context of Scala, the LMS (Lightweight Modular Staging) framework has contributed to "abstraction without regret"-high-level programming without performance penalty-in a number of challenging domains, through runtime code generation and embedded compiler pipelines based on stacks of DSLs. Based on this experience, this paper crystallizes some of the design decisions of LMS and discusses potential alternatives, which maintain the underlying spirit but differ in implementation choices: specifically, strategies for realizing more flexible front-end embeddings using type classes instead of higher-kinded types, and strategies for type-safe metaprogramming with untyped intermediate representations.

show abstract

“…Lancet [37] performs partial evaluation of Java bytecode snippets that need to be compiled by a just-in-time (JIT) compiler. JScp [27] performs supercompilation on Java bytecode. Like WIPER, the specializers in Lancet and JScp make use of a static partial store.…”

Section: Related Workmentioning

confidence: 99%

Partial evaluation of machine code

SrinivasanVenkatesh¹,

RepsThomas²

2015

SIGPLAN Not.

View full text Add to dashboard Buy / Rent full text

This paper presents an algorithm for off-line partial evaluation of machine code. The algorithm follows the classical two-phase approach of binding-time analysis (BTA) followed by specialization. However, machine-code partial evaluation presents a number of new challenges, and it was necessary to devise new techniques for use in each phase.• Our BTA algorithm makes use of an instruction-rewriting method that "decouples" multiple updates performed by a single instruction. This method counters the cascading imprecision that would otherwise occur with a more naïve approach to BTA.• Our specializer specializes an explicit representation of the semantics of an instruction, and emits residual code via machine-code synthesis. Moreover, to create code that allows the stack and heap to be at different positions at run-time than at specialization-time, the specializer represents specialization-time addresses using symbolic constants, and uses a symbolic state for specialization. Our experiments show that our algorithm can be used to specialize binaries with respect to commonly used inputs to produce faster binaries, as well as to extract an executable component from a bloated binary.

show abstract

A Java Supercompiler and Its Application to Verification of Cache-Coherence Protocols

Cited by 13 publications

References 21 publications

Collapsing towers of interpreters

Collapsing towers of interpreters

Reflections on LMS: exploring front-end alternatives

Partial evaluation of machine code

Contact Info

Product

Resources

About