POPL 1983
28 papers
- "Sometimes" and "Not Never" Revisited: On Branching Versus Linear Time
- A Program Form Based on Data Dependency in Predicate Regions
- Abstraction Mechanisms in the Beta Programming Language
- Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications: A Practical Approach
- Code Generation for Silicon
- Compilation of Data-Driven Programs for Synchronous Execution
- Computer Experiments with the Reve Term Rewriting System Generator
- Conversion of Control Dependence to Data Dependence
- Derivation of Efficient DAG Marking Algorithms
- Five Paradigm Shifts in Language Design and their Realization in Viron, a Dataflow Programming Environment
- How to Cook a Temporal Proof System for Your Pet Language
- Incremental Data Flow Analysis
- Incremental Polymorphic Type Checking in B
- Locality in Software Systems
- Loops in Combinator-Based Compilers
- Making Variables Abstract: An Equational Theory for Russell
- Mechanisms for Compile-Time Enforcement of Security
- On the Unification of Data and Program Abstraction in Ada
- Polymorphic Type Inference
- Practical Program Verification: Automatic Program Proving for Real-Time Embedded Software
- Practical Use of a Polymorphic Applicative Language
- Precise Typing of Abstract Data Type Specifications
- Reasoning About Nonatomic Operations
- Structural Semantics for Polymorphic Data Types
- Summarizing Graphs by Regular Expressions
- Transformational Programming - Applications to Algorithms and Systems
- Uncovering Principles of Novice Programming
- Verifying Reachability Invariants of Linked Structures