TOPLAS 1984
32 papers
- A Directly Executable Encoding for APL
- Algorithms for On-the-fly Garbage Collection
- An APL Compiler for a Vector Processor
- Annotations to Control Parallelism, Reduction Order in the Distributed Evaluation of Functional Programs
- Axiomatic Semantics of Communicating Sequential Processes
- Code Selection through Object Code Optimization
- Comments on Soisalon-Soininen's "Inessential Error Entries"
- Communicating Sequential Processes for Centralized and Distributed Operating System Design
- Distributed Algorithms for Finding Centers and Medians in Networks
- Encapsulation Constructs in Systems Programming Languages
- Global Data Flow Analysis Problems Arising in Locally Least-Cost Error Recovery
- Grammar-Based Definition of Metaprogramming Systems
- Jump Minimization in Linear Time
- Magma2: A Language Oriented toward Experiments in Control
- Modeling the Distributed Termination Convention of CSP
- Optimization of Parser Tables for Portable Compilers
- Proving Failure-Free Properties of Concurrent Systems Using Temporal Logic
- Real-Time Synchronization of Interprocess Communications
- Recursion As an Effective Step in Program Development
- Selective and Locally Controlled Transport of Privileges
- Synthesis of Communicating Processes from Temporal Logic Specifications
- Tailored-List and Recombination-Delaying Buddy Systems
- The "Hoare Logic" of CSP, and All That
- The Drinking Philosopher's Problem
- The Promotion and Accumulation Strategies in Transformational Programming
- The Type Theory of PL/CV3
- Transformations and Reduction Strategies for Typed Lambda Expressions
- Translation of Attribute Grammars into Procedures
- Unassigned Objects
- User Recovery and Reversal in Interactive Systems
- Using Message Passing for Distributed Programming: Proof Rules, Disciplines
- Using Time Instead of Timeout for Fault-Tolerant Distributed Systems