POPL 1980
25 papers
- "Sometime" is Sometimes "Not Never" - On the Temporal Logic of Programs
- "Type-Completeness" as a Language Design Principle
- A Case Study in Specifying the Semantics of a Programming Language
- A Dynamic Logic of Multiprocessing with Incomplete Information
- A High-Level Approach to Computer Document Formatting
- An Indeterminate Constructor for Applicative Programming
- An Overview of the Summer Programming Language
- Analysis of Pointer Rotation
- Analysis of Simple Programs Over Different Sets of Primitives
- Axiomatic Definitions of Programming Languages: A Theoretical Assessment
- Data Types, Parameters, and Type Checking
- Efficient Algorithms for Structural Similarity of Grammars
- Experience with an Applicative String Processing Language
- Expressiveness of the Operation Set of a Data Abstraction
- Final Data Tye Specifications: A New Data Type Specification Method
- Formal Specification as a Design Tool
- Interprocedural Data Flow Analysis in the Presence of Pointers, Procedure Variables and Label Variables
- On Proving Inductive Properties of Abstract Data Types
- On Specifying Verifiers
- On the Temporal Analysis of Fairness
- Prime Subprogram Parsing of a Program
- Propositional Logics of Programs: Systems, Models, and Complexity
- Qualified Data Flow Problems
- Synchronous Schemes and Their Decision Problems
- Theoretical and Emperical Studies on Using Program Mutation to Test the Functional Correctness of Programs