TOPLAS 1986

21 papers

1. A Formal Approach to Undo Operations in Programming Languages · George B. Leeman Jr.
2. A Short Proof of a Conjecture of DeRemer and Pennello · Thomas J. Sager
3. A Structural View of the Cedar Programming Environment · Daniel C. Swinehart, Polle T. Zellweger, Richard J. Beach, Robert Hagemann
4. An Example of Stepwise Refinement of Distributed Programs: Quiescence Detection · K. Mani Chandy, Jayadev Misra
5. Applicative Caching · Robert M. Keller, M. Ronan Sleep
6. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications · Edmund M. Clarke, E. Allen Emerson, A. Prasad Sistla
7. Axioms for Memory Access in Asynchronous Hardware Systems · Jayadev Misra
8. Clarification of "Feeding Inputs on Demand" in Efficient Demand-Driven Evaluation - Part 1 · Keshav Pingali, Arvind
9. Correctness Proofs of Distributed Termination Algorithms · Krzysztof R. Apt
10. Efficient Demand-Driven Evaluation - Part 2 · Keshav Pingali, Arvind
11. Generating Editing Environments Based on Relations and Attributes · Susan Horwitz, Tim Teitelbaum
12. Parlog: Parallel Programming in Logic · Keith L. Clark, Steve Gregory
13. Proving Liveness for Networks of Communicating Finite State Machines · Mohamed G. Gouda, Chung-Kuo Chang
14. Proving Systolic Systems Correct · Matthew Hennessy
15. Smart Recompilation · Walter F. Tichy
16. The Concept of a Supercompiler · Valentin F. Turchin
17. The Impact of Interprocedural Analysis and Optimization in the Rn Programming Environment · Keith D. Cooper, Ken Kennedy, Linda Torczon
18. The ML Approach to the Readable All-Purpose Language · Christopher R. Spooner
19. The PSG System: From Formal Language Definitions to Interactive Programming Environments · Rolf Bahlke, Gregor Snelting
20. The PegaSys System: Pictures as Formal Documentation of Large Programs · Mark Moriconi, Dwight F. Hare
21. Toward Compiler Implementation Correctness Proofs · Laurian M. Chirica, David F. Martin