TOPLAS 1983
28 papers
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- A Formal Framework for the Derivation of Machine-Specific Optimizers
- A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
- A Syntax-Error-Handling Technique and Its Experimental Analysis
- Access-Right Expressions
- An Effective Implementation for the Generalized Input-Output Construct of CSP
- Assessing Test Data Adequacy through Program Inference
- Automatic Program Improvement: Variable Usage Transformations
- Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors
- Comparison of Compacting Algorithms for Garbage Collection
- Concurrent Reading While Writing
- Control Flow Aspects of Semantics-Directed Compiling
- Correctness Proofs of Communicating Processes: Three Illustrative Examples from the Literature
- Eliminating Redundant Recursive Calls
- Experience with the SETL Optimizer
- Final Data Types and Their Specification
- Generation of Compiler Symbol Processing Mechanisms
- Guardians and Actions: Linguistic Support for Robust, Distributed Programs
- Incremental Context-Dependent Analysis for Language-Based Editors
- On the Construction of Submodule Specifications and Communication Protocols
- Parallel Generation of Postfix and Tree Forms
- Parameterized Specifications: Parameter Passing and Implementation with Respect to Observability
- Postpass Code Optimization of Pipeline Constraints
- Specifying Concurrent Program Modules
- Tentative Steps Toward a Development Method for Interfering Programs
- Termination of Probabilistic Concurrent Program
- User Format Control in a Lisp Prettyprinter
- VLSI Layout as Programming