TOPLAS 1993
29 papers
- A Calculus for Access Control in Distributed Systems
- A Correction to the Denotational Semantics for the Prolog of Nicholson and Foo
- A Formal Definition of Priority in CSP
- A Further Note on Hennessy's "Symbolic Debugging of Optimized Code"
- A General Framework for Semantics-Based Bottom-Up Abstract Interpretation of Logic Programs
- A Methodology for Implementing Highly Concurrent Objects
- A Superimposition Control Construct for Distributed Systems
- An Alternative Solution to a Problem on Self-Stabilization
- An Elimination Algorithm for Bidirectional Data Flow Problems Using Edge Placement
- Analysis of Or-Parallel Execution Models
- Compiling Nested Data-Parallel Programs for Shared-Memory Multiprocessors
- Composing Specifications
- Cost Analysis of Logic Programs
- Defining Context-Dependent Syntax Without Using Contexts
- Interprocedural Optimization: Eliminating Unnecessary Recompilation
- Lazy Caching
- Leader Election in Uniform Rings
- Mathematical Foundations of Time Warp Systems
- On the Type Structure of Standard ML
- Parameterized Partial Evaluation
- Procedural Implementation of Algebraic Specification
- Reasoning About Naming Systems
- Scheduling Time-Critical Instructions on RISC Machines
- Subtyping Recursive Types
- The Concurrency Workbench: A Semantics-Based Tool for the Verification of Concurrent Systems
- The Derivation of Distributed Termination Detection Algorithms from Garbage Collection Schemes
- The Design of the E Programming Language
- Type Inference with Polymorphic Recursion
- Type Reconstruction in the Presence of Polymorphic Recursion