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

On convergence toward a database of program transformations
David Barstow
Pages: 1-9
DOI: 10.1145/2363.2364
Several fairly large sets of programming rules have been developed recently. It is natural to ask whether the process of developing such rule bases may converge. Having developed sets of rules for specific programming tasks and domains, will...

A distributed alternative to finite-state-machine specifications
Pamela Zave
Pages: 10-36
DOI: 10.1145/2363.2365
A specification technique, formally equivalent to finite-state machines, is offered as an alternative because it is inherently distributed and more comprehensible. When applied to modules whose complexity is dominated by control, the technique...

Information-flow and data-flow analysis of while-programs
Jean-Francois Bergeretti, Bernard A. Carré
Pages: 37-61
DOI: 10.1145/2363.2366
Until recently, information-flow analysis has been used primarily to verify that information transmission between program variables cannot violate security requirements. Here, the notion of information flow is explored as an aid to program...

Optimal prepaging and font caching
David R. Fuchs, Donald E. Knuth
Pages: 62-79
DOI: 10.1145/2363.2367
An efficient algorithm for communicating letter-shape information from a high-speed computer with a large memory to a typesetting device that has a limited memory is presented. The encoding is optimum, in the sense that the total time for...

Generative communication in Linda
David Gelernter
Pages: 80-112
DOI: 10.1145/2363.2433
Generative communication is the basis of a new distributed programming langauge that is intended for systems programming in distributed settings generally and on integrated network computers in particular. It differs from previous interprocess...

Proofs as programs
Joseph L. Bates, Robert L. Constable
Pages: 113-136
DOI: 10.1145/2363.2528
The significant intellectual cost of programming is for problem solving and explaining, not for coding. Yet programming systems offer mechanical assistance for the coding process exclusively. We illustrate the use of an implemented program...

Generalizing specifications for uniformly implemented loops
Douglas D. Dunlop, Victor R. Basili
Pages: 137-158
DOI: 10.1145/2363.2708
The problem of generalizing functional specifications for while loops is considered. This problem occurs frequently when trying to verify that an initialized loop satisfies some functional specification, i.e., produces outputs which are some...

A new analysis of LALR formalisms
Joseph C.H. Park, K. M. Choe, C. H. Chang
Pages: 159-175
DOI: 10.1145/2363.2527
The traditional LALR analysis is reexamined using a new operator and an associated graph. An improved method that allows factoring out a crucial part of the computation for defining states of LR(0) canonical collection and for computing LALR(1)...

A note on Hennessy's “symbolic debugging of optimized code”
David Wall, Amitabh Srivastava, Fred Templin
Pages: 176-181
DOI: 10.1145/2363.215005