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

Program transformations in a denotational setting
Flemming Nielson
Pages: 359-379
DOI: 10.1145/3916.3917
Program transformations are frequently performed by optimizing compilers, and the correctness of applying them usually depends on data flow information. For language-to-same-language transformations, it is shown how a denotational setting can be...

Describing and analyzing distributed software system designs
George S. Avrunin, Jack C. Wileden
Pages: 380-403
DOI: 10.1145/3916.3989
In this paper we outline an approach to describing and analyzing designs for distributed software systems. A descriptive notation is introduced, and analysis techniques applicable to designs expressed in that notation are presented. The...

Virtual time
David R. Jefferson
Pages: 404-425
DOI: 10.1145/3916.3988
Virtual time is a new paradigm for organizing and synchronizing distributed systems which can be applied to such problems as distributed discrete event simulation and distributed database concurrency control. Virtual time...

Data types are values
James Donahue, Alan Demers
Pages: 426-445
DOI: 10.1145/3916.3987
An important goal of programming language research is to isolate the fundamenal concepts of languages, those basic ideas that allow us to understand the relationships among various language features. This paper examines one of these underlying...

Program abstraction and instantiation
Nachum Dershowitz
Pages: 446-477
DOI: 10.1145/3916.3986
Our goal is to develop formal methods for abstracting a given set of programs into a program schema and for instantiating a given schema to satisfy concrete specifications. Abstraction and instantiation are two important phases in software...

Noncorrecting syntax error recovery
Helmut Richter
Pages: 478-489
DOI: 10.1145/3916.4019
A parser must be able to continue parsing after encountering a syntactic error to check the remainder of the input. To achieve this, it is not necessary to perform corrections on either the input text or the stack contents. A formal framework is...