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 3, July 1989

Integrating noninterfering versions of programs
Susan Horwitz, Jan Prins, Thomas Reps
Pages: 345-387
DOI: 10.1145/65979.65980
The need to integrate several versions of a program into a common one arises frequently, but it is a tedious and time consuming task to integrate programs by hand. To date, the only available tools for assisting with program integration are...

Efficient implementation of the first-fit strategy for dynamic storage allocation
R. P. Brent
Pages: 388-403
DOI: 10.1145/65979.65981
We describe an algorithm that efficiently implements the first-fit strategy for dynamic storage allocation. The algorithm imposes a storage overhead of only one word per allocated block (plus a few percent of the total space used for dynamic...

On Lamport's interprocessor communication model
Frank D. Anger
Pages: 404-417
DOI: 10.1145/65979.65982
Leslie Lamport presented a set of axioms in 1979 that capture the essential properties of the temporal relationships between complex and perhaps unspecified activities within any system, and proceeded to use this axiom system to prove the...

Static inference of modes and data dependencies in logic programs
Saumya K. Debray
Pages: 418-450
DOI: 10.1145/65979.65983
Mode and data dependency analyses find many applications in the generation of efficient executable code for logic programs. For example, mode information can be used to generate specialized unification instructions where permissible, to detect...

Functional computations in logic programs
Saumya K. Debray, David S. Warren
Pages: 451-481
DOI: 10.1145/65979.65984
Although the ability to simulate nondeterminism and to compute multiple solutions for a single query is a powerful and attractive feature of logic programming languages, it is expensive in both time and space. Since programs in such languages...