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 11 Issue 2, April 1989

Incremental dynamic semantics for language-based programming environments
G. E. Kaiser
Pages: 169-193
DOI: 10.1145/63264.63400
Attribute grammars are a formal notation for expressing the static semantics of programming languages—those properties that can be derived from inspection of the program text. Attribute grammars have become popular as a mechanism for...

Efficient high-level iteration with accumulators
Robert D. Cameron
Pages: 194-211
DOI: 10.1145/63264.63401
Accumulators are proposed as a new type of high-level iteration construct for imperative languages. Accumulators are user-programmed mechanisms for successively combining a sequence of values into a single result value. The...

Designing families of data types using exemplars
Wilf R. LaLonde
Pages: 212-248
DOI: 10.1145/63264.63265
Designing data types in isolation is fundamentally different from designing them for integration into communities of data types, especially when inheritance is a fundamental issue. Moreover, we can distinguish between the design of...

Local atomicity properties: modular concurrency control for abstract data types
W. E. Weihl
Pages: 249-282
DOI: 10.1145/63264.63518
Atomic actions (or transactions) are useful for coping with concurrency and failures. One way of ensuring atomicity of actions is to implement applications in terms of atomic data types: abstract data types whose objects ensure...

ECCS and LIPS: two languages for OSI systems specification and verification
V. Carchiolo, A. Di Stefano, A. Faro, G. Pappalardo
Pages: 284-329
DOI: 10.1145/63264.63402
An issue of current interest in the Open Systems Interconnection (OSI) field is the choice of a language well suited to specification and verification. For this purpose, two languages based on Milner's communication calculi are proposed,...

Uniform self-stabilizing rings
J. E. Burns, Jan K. Pachl
Pages: 330-344
DOI: 10.1145/63264.63403
A self-stabilizing system has the property that, no matter how it is perturbed, it eventually returns to a legitimate configuration. Dijkstra originally introduced the self-stabilization problem and gave several solutions for a...