Logics of Programs : Brooklyn, June 17-19, 1985
Computer network architectures Logic design Computer science Computer System Implementation Logics and Meanings of Programs Mathematical Logic and Formal Languages Computation by Abstract Devices
Imprint: Springer
1985
1st ed. 1985.
EISBN 354039527X
Nonclausal temporal deduction.
Unsolvable terms in typed lambda calculus with fix-point operators: Extended abstract.
Lambda calculus with constrained types.
An axiomatic treatment of a parallel programming language.
Recursive definitions in type theory.
Errata.
Automata, tableaux, and temporal logics.
Proving termination of Prolog programs.
A Hoare Calculus for functions defined by recursion on higher types.
On the relative incompleteness of logics for total correctness.
From synchronization tree logic to acceptance model logic.
A FASE specification of FP.
On asymptotic probabilities of inductive queries and their decision problem.
Compositional semantics for real-time distributed computing.
Partial-correctness theories as first-order theories.
The glory of the past.
Continuation semantics in typed lambda-calculi.
Second-order logical relations.
Behavior: a temporal appreach to process modeling.
Equational logic as a programming language: Abstract.
Distributed processes and the logic of knowledge.
Some constructions for order-theoretic models of concurrency.
Proving fairness of schedulers.
The reasoning powers of Burstall's (modal logic) and Pnueli's (temporal logic) program verification methods.
A partial correctness logic for procedures.
A proof system for Distributed Processes.
Fixpoints and program looping: Reductions from the Propositional mu-calculus into Propositional Dynamic Logics of Looping.
Semantical analysis of specification logic.
A simple programming language with data types: semantics and verification.
Computer aided reasoning.
The taming of converse: Reasoning about two-way computations.
Unsolvable terms in typed lambda calculus with fix-point operators: Extended abstract.
Lambda calculus with constrained types.
An axiomatic treatment of a parallel programming language.
Recursive definitions in type theory.
Errata.
Automata, tableaux, and temporal logics.
Proving termination of Prolog programs.
A Hoare Calculus for functions defined by recursion on higher types.
On the relative incompleteness of logics for total correctness.
From synchronization tree logic to acceptance model logic.
A FASE specification of FP.
On asymptotic probabilities of inductive queries and their decision problem.
Compositional semantics for real-time distributed computing.
Partial-correctness theories as first-order theories.
The glory of the past.
Continuation semantics in typed lambda-calculi.
Second-order logical relations.
Behavior: a temporal appreach to process modeling.
Equational logic as a programming language: Abstract.
Distributed processes and the logic of knowledge.
Some constructions for order-theoretic models of concurrency.
Proving fairness of schedulers.
The reasoning powers of Burstall's (modal logic) and Pnueli's (temporal logic) program verification methods.
A partial correctness logic for procedures.
A proof system for Distributed Processes.
Fixpoints and program looping: Reductions from the Propositional mu-calculus into Propositional Dynamic Logics of Looping.
Semantical analysis of specification logic.
A simple programming language with data types: semantics and verification.
Computer aided reasoning.
The taming of converse: Reasoning about two-way computations.
