TOPLAS 1980
31 papers
- A Coroutine Approach to Parsing
- A Deductive Approach to Program Synthesis
- A Formal System for Reasoning about Programs Accessing a Relational Database
- A Note on Median Split Trees
- A Proof System for Communicating Sequential Processes
- Ada Exception Handling: An Axiomatic Approach
- An Abstract Type for Statistics Collection in Simula
- An Alternative to the Use of Patterns in String Processing
- An Axiomatic Approach to Information Flow in Programs
- An Improved Context-Free Recognizer
- And/Or Programs: A New Approach to Structured Programming
- Applicability of Software Validation Techniques to Scientific Programs
- Assignment and Procedure Call Proof Rules
- Automatic Derivation of Code Generators from Machine Descriptions
- Chaining Span-Dependent Jump Instructions
- Derivation of Invariant Assertions During Program Development by Transformation
- Design of a Machine-Independent Optimizing System for Emulator Development
- Distributed Termination
- External Representations of Objects of User-Defined Type
- Global Context Recovery: A New Strategy for Syntactic Error Recovery by Table-Drive Parsers
- Managing Reentrant Structures Using Reference Counts
- On Parsing and Compiling Arithmetic Expressions on Vector Computers
- On the Performance of Balanced Hashing Functions When the Keys Are Not Equiprobable
- Output Guards and Nondeterminism in "Communicating Sequential Processes"
- Prettyprinting
- Specification of Abstract Data Types in Modula
- Synthesis of Resource Invariants for Concurrent Programs
- The Activity of a Variable and Its Relation to Decision Trees
- The Design and Application of a Retargetable Peephole Optimizer
- Ultracomputers
- Uniform Random Generation of Balanced Parenthesis Strings