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 12 Issue 3, July 1990

An interval-based approach to exhaustive and incremental interprocedural data-flow analysis
Michael Burke
Pages: 341-395
DOI: 10.1145/78969.78963
We reformulate interval analysis so that it can he applied to any monotone data-flow problem, including the nonfast problems of flow-insensitive interprocedural analysis. We then develop an incremental interval analysis technique that can be...

win and sin: predicate transformers for concurrency
Leslie Lamport
Pages: 396-428
DOI: 10.1145/78969.78970
The weakest liberal precondition and strongest postcondition predicate transformers are generalized to the weakest invariant and strongest invariant. These new predicate...

Efficient evaluation of circular attribute grammars
Larry G. Jones
Pages: 429-462
DOI: 10.1145/78969.78971
We present efficient algorithms for exhaustive and incremental evaluation of circular attributes under any conditions that guarantee finite convergence. The algorithms are derived from those for noncircular attribute grammars by partitioning the...

Linearizability: a correctness condition for concurrent objects
Maurice P. Herlihy, Jeannette M. Wing
Pages: 463-492
DOI: 10.1145/78969.78972
A concurrent object is a data object shared by concurrent processes. Linearizability is a correctness condition for concurrent objects that exploits the semantics of abstract data types. It permits a high degree of concurrency, yet it permits...