Interpreting programs in static single assignment form

Authors:
Jeffery von Ronne;Ning Wang;Michael Franz
Affiliations:
University of California Irvine, Irvine, CA;University of California Irvine, Irvine, CA;University of California Irvine, Irvine, CA
Venue:
Proceedings of the 2004 workshop on Interpreters, virtual machines and emulators
Year:
2004

Citing 18
Cited 0

Detecting equality of variables in programs

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Global value numbers and redundant computations

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Efficiently computing static single assignment form and the control dependence graph

ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimizing an ANSI C interpreter with superoperators

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Stack caching for interpreters

PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
Array SSA form and its use in parallelization

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Optimizing direct threaded code by selective inlining

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Building an optimizing compiler

Building an optimizing compiler
Indirect threaded code

Communications of the ACM
Threaded code

Communications of the ACM
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
Improving mobile program performance through the use of a hybrid intermediate representation

PPPJ '02/IRE '02 Proceedings of the inaugural conference on the Principles and Practice of programming, 2002 and Proceedings of the second workshop on Intermediate representation engineering for virtual machines, 2002
Vmgen: a generator of efficient virtual machine interpreters

Software—Practice & Experience
Optimizing indirect branch prediction accuracy in virtual machine interpreters

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
The case for virtual register machines

Proceedings of the 2003 workshop on Interpreters, virtual machines and emulators
Mixed-mode Bytecode Execution

Mixed-mode Bytecode Execution
A portable research framework for the execution of java bytecode

A portable research framework for the execution of java bytecode

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimizing compilers, including those in virtual machines, commonly utilize Static Single Assignment Form as their intermediate representation, but interpreters typically implement stack-oriented virtual machines. This paper introduces an easily interpreted variant of Static Single Assignment Form. Each instruction of this Interpretable Static Single Assignment Form, including the Phi Instruction, has self-contained operational semantics facilitating efficient interpretation. Even the array manipulation instructions possess directly-executable single-assignment semantics. In addition, this paper describes the construction of a prototype virtual machine realizing Interpretable Static Single Assignment Form and reports on its performance.