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 17 Issue 1, Jan. 1995

Optimal incremental parsing
J.-M. Larchevêque
Pages: 1-15
DOI: 10.1145/200994.200996
This communication sets the problem of incremental parsing in the context of a complete incremental compiling system. It turns out that, according to the incrementally paradigm of the attribute evaluator and data-flow analyzer to be used, two...

Deducing fairness properties in UNITY logic—a new completeness result
Yih-Kuen Tsay, Rajive L. Bagrodia
Pages: 16-27
DOI: 10.1145/200994.200997
We explore the use of UNITY logic in specifying and verifying fairness properties of UNITY and UNITY-like programs whose semantics can be modeled by weakly fair transition systems. For such programs, strong fairness properties in the form of...

Improving abstract interpretations by combining domains
Michael Codish, Anne Mulkers, Maurice Bruynooghe, Maria García de la Banda, Manuel Hermenegildo
Pages: 28-44
DOI: 10.1145/200994.200998
This article considers static analysis based on abstract interpretation of logic programs over combined domains. It is known that analyses over combined domains provide more information potentially than obtained by the independent analyses....

Notes on “A methodology for implementing highly concurrent data objects”
Joseph P. Skudlarek
Pages: 45-46
DOI: 10.1145/200994.200999

Closure analysis in constraint form
Jens Palsberg
Pages: 47-62
DOI: 10.1145/200994.201001
Flow analyses of untyped higher-order functional programs have in the past decade been presented by Ayers, Bondorf, Consel, Jones, Heintze, Sestoft, Shivers, Steckler, Wand, and others. The analyses are usually defined as abstract...

Safe: a semantic technique for transforming programs in the presence of errors
Alexander Aiken, John H. Williams, Edward L. Wimmers
Pages: 63-84
DOI: 10.1145/200994.201002
Language designers and implementors have avoided specifying and preserving the meaning of programs that produce errors. This is apparently because being forced to preserve error behavior limits severely the scope of program optimization, even...

Beyond induction variables: detecting and classifying sequences using a demand-driven SSA form
Michael P. Gerlek, Eric Stoltz, Michael Wolfe
Pages: 85-122
DOI: 10.1145/200994.201003
Linear induction variable detection is usually associated with the strength reduction optimization. For restructuring compilers, effective data dependence analysis requires that the compiler detect and accurately describe linear and nonlinear...

Optimal evaluation of array expressions on massively parallel machines
Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber, Shang-Hua Teng
Pages: 123-156
DOI: 10.1145/200994.201004
We investigate the problem of evaluating Fortran 90-style array expressions on massively parallel distributed-memory machines. On such a machine, an elementwise operation can be performed in constant time for arrays whose corresponding elements...

Local and temporal predicates in distributed systems
Bernadette Charron-Bost, Carole Delporte-Gallet, Hugues Fauconnier
Pages: 157-179
DOI: 10.1145/200994.201005
The definitions of the predicates Possibly &fgr; and Definitely &fgr;, where &fgr; is a global predicate of a distributed computation, lead to the definitions of two predicate transformers P and D. We show that...