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 27 Issue 4, July 2005

The KaffeOS Java runtime system
Godmar Back, Wilson C. Hsieh
Pages: 583-630
DOI: 10.1145/1075382.1075383
Single-language runtime systems, in the form of Java virtual machines, are widely deployed platforms for executing untrusted mobile code. These runtimes provide some of the features that operating systems provide: interapplication memory protection...

Cost and precision tradeoffs of dynamic data slicing algorithms
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
Pages: 631-661
DOI: 10.1145/1075382.1075384
Dynamic slicing algorithms are used to narrow the attention of the user or an algorithm to a relevant subset of executed program statements. Although dynamic slicing was first introduced to aid in user level debugging, increasingly applications aimed...

Interprocedural parallelization analysis in SUIF
Mary W. Hall, Saman P. Amarasinghe, Brian R. Murphy, Shih-Wei Liao, Monica S. Lam
Pages: 662-731
DOI: 10.1145/1075382.1075385
As shared-memory multiprocessor systems become widely available, there is an increasing need for tools to simplify the task of developing parallel programs. This paper describes one such tool, the automatic parallelization system in the Stanford SUIF...

Design and evaluation of dynamic optimizations for a Java just-in-time compiler
Toshio Suganuma, Toshiaki Yasue, Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatani
Pages: 732-785
DOI: 10.1145/1075382.1075386
The high performance implementation of Java Virtual Machines (JVM) and Just-In-Time (JIT) compilers is directed toward employing a dynamic compilation system on the basis of online runtime profile information. The trade-off between the compilation...

Analysis of recursive state machines
Rajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas Reps, Mihalis Yannakakis
Pages: 786-818
DOI: 10.1145/1075382.1075387
Recursive state machines (RSMs) enhance the power of ordinary state machines by allowing vertices to correspond either to ordinary states or to potentially recursive invocations of other state machines. RSMs can model the control flow in sequential...