ACM DL

Programming Languages and Systems (TOPLAS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 22 Issue 4, July 2000

Graph rewrite systems for program optimization
Uwe Assmann
Pages: 583-637
DOI: 10.1145/363911.363914
Graph rewrite systems can be used to specify and generate program optimizations. For termination of the systems several rule-based criteria are developed, defining exhaustive graph rewrite systems. For nondeterministic systems...

Standard fixpoint iteration for Java bytecode verification
Zhenyu Qian
Pages: 638-672
DOI: 10.1145/363911.363915
Java bytecode verification forms the basis for Java-based Internet security and needs a rigorous description. One important aspect of bytecode verification is to check if a Java Virtual Machine (JVM) program is statically well-typed. So far,...

Program transformation and runtime support for threaded MPI execution on shared-memory machines
Hong Tang, Kai Shen, Tao Yang
Pages: 673-700
DOI: 10.1145/363911.363920
Parallel programs written in MPI have been widely used for developing high-performance applications on various platforms. Because of a restriction of the MPI computation model, conventional MPI implementations on shared-memory machines map each...

Typed memory management via static capabilities
David Walker, Karl Crary, Greg Morrisett
Pages: 701-771
DOI: 10.1145/363911.363923
Region-based memory management is an alternative to standard tracing garbage collection that makes operation such as memory deallocation explicit but verifiably safe. In this article, we present a new compiler intermediate language, called the...