ACM Transactions on Programming Languages and Systems (TOPLAS)
, Volume 4
Volume 4, Number 1, January 1982
Martin S. Feather
: A System for Assisting Program Transformation. 1-20
BibTeX
Andrew S. Tanenbaum
,
Hans van Staveren
,
Johan W. Stevenson
: Using Peephole Optimization on Intermediate Code. 21-36
BibTeX
Jayadev Misra
,
K. Mani Chandy
: Termination Detection of Diffusing Computations in Communicating Sequential Processes. 37-43
BibTeX
James R. McGraw
: The VAL Language: Description and Analysis. 44-82
BibTeX
Christoph M. Hoffmann
,
Michael J. O'Donnell
: Programming with Equations. 83-112
BibTeX
M. Howard Williams
: A Flexible Notation for Syntactic Definitions. 113-119
BibTeX
Volume 4, Number 2, April 1982
Fred B. Schneider
: Synchronization in Distributed Programs. 125-148
BibTeX
Richard C. Holt
,
James R. Cordy
,
David B. Wortman
: An Introduction to S/SL: Syntax/Semantic Language. 149-178
BibTeX
Eljas Soisalon-Soininen
: Inessential Error Entries and Their Use in LR Parser Optimization. 179-195
BibTeX
Micha Sharir
: Some Observations Concerning Formal Differentiation of Set Theoretic Expressions. 196-225
BibTeX
C. S. Wetherell
: Error Data Values in the Data-Flow Language VAL. 226-238
BibTeX
Richard J. Fateman
: High-Level Language Implications of the Proposed IEEE Floating-Point Standard. 239-257
BibTeX
Alberto Martelli
,
Ugo Montanari
: An Efficient Unification Algorithm. 258-282
BibTeX
Edward A. Ashcroft
,
William W. Wadge
: R/ for Semantics. 283-294
BibTeX
Jacques J. Arsac
,
Yves Kodratoff
: Some Techniques for Recursion Removal from Recursive Programs. 295-322
BibTeX
Volume 4, Number 3, July 1982
John L. Hennessy
: Symbolic Debugging of Optimized Code. 323-344
BibTeX
Paolo Sipala
: Compact Storage of Binary Trees. 345-361
BibTeX
Manfred Broy
,
Peter Pepper
: Combining Algebraic and Algorithmic Reasoning: An Approach to the Schorr-Waite Algorithm. 362-381
BibTeX
Leslie Lamport
,
Robert E. Shostak
,
Marshall C. Pease
: The Byzantine Generals Problem. 382-401
BibTeX
Robert Paige
,
Shaye Koenig
: Finite Differencing of Computable Expressions. 402-454
BibTeX
Susan S. Owicki
,
Leslie Lamport
: Proving Liveness Properties of Concurrent Programs. 455-495
BibTeX
Mitchell Wand
: Deriving Target Code as a Representation of Continuation Semantics. 496-517
BibTeX
Volume 4, Number 4, October 1982
Maurice Herlihy
,
Barbara Liskov
: A Value Transmission Method for Abstract Data Types. 527-551
BibTeX
Richard C. Holt
,
David B. Wortman
: A Model for Implementing Euclid Modules and Prototypes. 552-562
BibTeX
Ralph E. Griswold
: The Evaluation of Expressions in Icon. 563-584
BibTeX
J. Bergeron
,
A. Dubuque
: A Structured APL System. 585-600
BibTeX
Theodore P. Baker
: A One-Pass Algorithm for Overload Resolution in Ada. 601-614
BibTeX
Frank DeRemer
,
Thomas J. Pennello
: Efficient Computation of LALR(1) Look-Ahead Sets. 615-649
BibTeX
Robert B. K. Dewar
,
Micha Sharir
,
Elia Weixelbaum
: Transformational Derivation of a Garbage Collection Algorithm. 650-667
BibTeX
H. J. Boom
: A Weaker Precondition for Loops. 668-677
BibTeX
Jayadev Misra
,
K. Mani Chandy
: A Distributed Graph Algorithm: Knot Detection. 678-686
BibTeX
William R. Mallgren
: Formal Specification of Graphic Data Types. 687-710
BibTeX
James W. Thatcher
,
Eric G. Wagner
,
Jesse B. Wright
: Data Type Specification: Parameterization and the Power of Specification Techniques. 711-732
BibTeX
John H. Williams
: On the Development of the Algebra of Functional Programs. 733-757
BibTeX
Gary L. Peterson
: An O(n log n) Unidirectional Algorithm for the Circular Extrema Problem. 758-762
BibTeX
Copyright ©
Sun May 17 00:30:18 2009 by
Michael Ley
(
ley@uni-trier.de
)