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 1, Jan. 1990

A mechanism for environment integration
Geoffrey Clemm, Leon Osterweil
Pages: 1-25
DOI: 10.1145/77606.77607
This paper describes research associated with the development and evaluation of Odin-an environment integration system based on the idea that tools should be integrated around a centralized store of persistent software objects. The paper...

Interprocedural slicing using dependence graphs
Susan Horwitz, Thomas Reps, David Binkley
Pages: 26-60
DOI: 10.1145/77606.77608
The notion of a program slice, originally introduced by Mark Weiser, is useful in program debugging, automatic parallelization, and program integration. A slice of a program is taken with respect to a program point...

Production trees: a compact representation of parsed programs
Vance E. Waddle
Pages: 61-83
DOI: 10.1145/77606.77609
Abstract syntax trees were devised as a compact alternative to parse trees, because parse trees are known to require excessive amounts of storage to represent parsed programs. However, the savings that abstract syntax trees actually achieve have...

A modular technique for the design of efficient distributed leader finding algorithms
E. Korach, S. Kutten, S. Moran
Pages: 84-101
DOI: 10.1145/77606.77610
A general, modular technique for designing efficient leader finding algorithms in distributed, asynchronous networks is developed. This technique reduces the problem of efficient leader finding to a simpler problem of efficient serial traversing...

A distributed deadlock detection algorithm for CSP-like communication
S. -T. Huang
Pages: 102-122
DOI: 10.1145/77606.77611
An algorithm for detecting deadlocks in distributed systems with CSP-like communication is proposed. Unlike previous work, the proposed algorithm avoids periodically sending deadlock-detecting messages by the processes and...

A correctness proof for combinator reduction with cycles
William M. Farmer, John D. Ramsdell, Ronald J. Watro
Pages: 123-134
DOI: 10.1145/77606.77612
Turner popularized a technique of Wadsworth in which a cyclic graph rewriting rule is used to implement reduction of the fixed point combinator Y. We examine the theoretical foundation of this approach. Previous work has...

Type extension through polymorphism
F. Warren Burton
Pages: 135-138
DOI: 10.1145/77606.214515
A record data type can be extended by addition of more fields. The extended type is a subtype of the original, in that any value of the extended type can be regarded as a value of the original type by ignoring the additional...

On iterative constructs
David Lorge Parnas
Pages: 139-141
DOI: 10.1145/77606.214517
The wheel is repeatedly reinvented because it is a good idea. Perhaps Anson's "A Generalized Iterative Construct and Its Semantics" [1] confirms that “A Generalized Control Structure and Its Formal Definition” [2],...