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 2, April 1990

Creating user interfaces using programming by example, visual programming, and constraints
Brad A. Myers
Pages: 143-177
DOI: 10.1145/78942.78943
Peridot is an experimental tool that allows designers to create user interface components without conventional programming. The designer draws pictures of what the interface should look like and then uses the mouse and other input devices to...

Linguistic support for atomic data types
William E. Weihl
Pages: 178-202
DOI: 10.1145/78942.78944
The problems of concurrency and failures in distributed systems can be addressed by implementing applications in terms of atomic data types: data types whose objects provide serializability and recoverability for transactions using them. The...

An exercise in the formal derivation of parallel programs: maximum flows in graphs
Edgar Knapp
Pages: 203-223
DOI: 10.1145/78942.78945
We apply a new method for the development of parallel programs to the problem of finding maximum flows in graphs. The method facilitates concurrent program design by separating the concerns of correctness from those of hardware and...

Search direction by goal failure in goal-oriented programming
Jared L. Darlington
Pages: 224-252
DOI: 10.1145/78942.78946
A new approach to goal-oriented programming is described, whereby the search for values of variables to satisfy a goal is invariably directed by that goal or by information provided by its failure. This goal-directed approach is in contrast to...

A method for specializing logic programs
A. Bossi, N. Cocco, S. Dulli
Pages: 253-302
DOI: 10.1145/78942.78947
A specialization method for logic programs that allows one to restrict a general program to special cases by means of constraint predicates is presented. A set of basic transformation operations, which are shown to produce equivalent programs,...

Adding liveness properties to coupled finite-state machines
S. Aggarwal, C. Courcoubetis, P. Wolper
Pages: 303-339
DOI: 10.1145/78942.78948
Informal specifications of protocols are often imprecise and incomplete and are usually not sufficient to ensure the correctness of even very simple protocols. Consequently, formal specification methods, such as finite-state models, are...