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 10 Issue 2, April 1988

An Ada package for dimensional analysis
Paul N. Hilfinger
Pages: 189-203
DOI: 10.1145/42190.42346
This paper illustrates the use of Ada's abstraction facilities—notably, operator overloading and type parameterization—to define an oft-requested feature: a way to attribute units of measure to variables and values. The definition...

Type extensions
N. Wirth
Pages: 204-214
DOI: 10.1145/42190.46167
Software systems represent a hierarchy of modules. Client modules contain sets of procedures that extend the capabilities of imported modules. This concept of extension is here applied to data types. Extended types are related to their ancestor...

Abstract interaction tools: a language for user interface management systems
Jan Van Den Bos
Pages: 215-247
DOI: 10.1145/42190.42191
A language model is presented for the specification of User Interface Management Systems. The model, called the Abstract Interaction Tool (AIT) model, offers a tree-like hierarchy of interaction objects. Each object represents a subtree and can...

ACE: an automatic complexity evaluator
Daniel Le Métayer
Pages: 248-266
DOI: 10.1145/42190.42347
There has been a great deal of research done on the evaluation of the complexity of particular algorithms; little effort, however, has been devoted to the mechanization of this evaluation. The ACE (Automatic Complexity Evaluator) system is able...

Control predicates are better than dummy variables for reasoning about program control
Leslie Lamport
Pages: 267-281
DOI: 10.1145/42190.42348
When explicit control predicates rather than dummy variables are used, the Owicki-Gries method for proving safety properties of concurrent programs can be strengthened, making it easier to construct the required program annotations. ...

Efficient and correct execution of parallel programs that share memory
Dennis Shasha, Marc Snir
Pages: 282-312
DOI: 10.1145/42190.42277
In this paper we consider an optimization problem that arises in the execution of parallel programs on shared-memory multiple-instruction-stream, multiple-data-stream (MIMD) computers. A program on such machines consists of many sequential...

Simple, efficient, asynchronous parallel algorithms for maximization
Albert G. Greenberg, Boris D. Lubachevsky, Andrew M. Odlyzko
Pages: 313-337
DOI: 10.1145/42190.42278
The problem of computing the maximum of n inputs on an asynchronous parallel computer is considered. In general, the inputs may arrive staggered in time, the number of processors available to the maximization algorithm may vary...

On the (non-) relationship between SLR(1) and NQLALR(1) grammars
Manuel E. Bermudez, Karl M. Schimpf
Pages: 338-342
DOI: 10.1145/42190.42276
A popular but “not-quite” correct technique for computing LALR(1) look-ahead sets has been formalized by DeRemer and Pennello and dubbed NQLALR(l). They also claim that the class of SLR(l) grammars is a subset of the class of...