TOPLAS 1981
24 papers
- A Cost Model for the Internal Organization of B+-Tree Nodes
- A Multiprocessing Approach to Compile-Time Symbol Resolution
- A Statement-Oriented Approach to Data Abstraction
- Algorithm 568: PDS - A Portable Directory System
- An Automatic Technique for Selection of Data Structures in SETL Programs
- An Exercise in Program Explanation
- Associons: A Program Notation with Tuples Instead of Variables
- Compilation of Acyclic Smooth Programs for Parallel Execution
- Data-Abstraction Implementation, Specification, and Testing
- Deleting Irrelevant Tasks in an Expression-Oriented Multiprocessor System
- Editing Data Structures
- Generators in Icon
- Handling Operator Precedence in Arithmetic Expressions with Tree Transformations
- Locally Least-Cost Error Recovery in Early's Algorithm
- Methods for Computing LALR(k) Lookahead
- Nonsequentiality and Concrete Activity Phases in Discrete-Event Simulation Languages
- Process Communication Based on Input Specifications
- Referencing and Retention in Block-Structured Coroutines
- Space-Efficient Storage Management in an Attribute Grammar Evaluator
- Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer
- Synchronizing Resources
- Ten Years of Hoare's Logic: A Survey - Part 1
- The Construction of Stack-Controlling LR Parsers for Regular Right Part Grammars
- The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory