TOPLAS 1990
24 papers
- A Comparative Evaluation of Object Definition Techniques
- A Correctness Proof for Combinator Reduction with Cycles
- A Distributed Deadlock Detection Algorithm for CSP-Like Communication
- A Mechanism for Environment Integration
- A Method for Specializing Logic Programs
- A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms
- Adding Liveness Properties to Coupled Finite-State Machines
- An Approach to Support Automatic Generation of User Interfaces
- An Exercise in the Formal Derivation of Parallel Programs: Maximum Flows in Graphs
- An Interval-Based Approach to Exhaustive and Incremental Interprocedural Data-Flow Analysis
- Creating User Interfaces Using Programming by Example, Visual Programming, and Constraints
- Efficient Evaluation of Circular Attribute Grammars
- Interprocedural Slicing Using Dependence Graphs
- Linearizability: A Correctness Condition for Concurrent Objects
- Linguistic Support for Atomic Data Types
- On Iterative Constructs
- On Kilbury's Modification of Earley's Algorithm
- Production Trees: A Compact Representation of Parsed Programs
- Remote Evaluation
- Search Direction by Goal Failure in Goal-Directed Programming
- The Priority-Based Coloring Approach to Register Allocation
- Type Extension Through Polymorphism
- Using Symbolic Execution for Verification of Ada Tasking Programs
- win and sin: Predicate Transformers for Concurrency