Logics of Programs: Workshop, Carnegie Mellon University Pittsburgh, PA, June 6–8, 1983

A static analysis of CSP programs....Pages 1-17
Compactness in semantics for merge and fair merge....Pages 18-33
Algebraic tools for system construction....Pages 34-44
PC-compactness, a necessary condition for the existence of sound and complete logics of partial correctness....Pages 45-56
The intractability of validity in logic programming and dynamic logic....Pages 57-67
A semantics and proof system for communicating processes....Pages 68-85
Non-standard fixed points in first order logic....Pages 86-100
Automatic verification of asynchronous circuits....Pages 101-115
Mathematics as programming....Pages 116-128
Characterization of acceptable by algol-like programming languages....Pages 129-146
A rigorous approach to fault-tolerant system development....Pages 147-160
A sound and relatively complete axiomatization of clarke's language L 4 ....Pages 161-175
Deciding branching time logic: A triple exponential decision procedure for CTL....Pages 176-192
Equations in combinatory algebras....Pages 193-205
Reasoning about procedures as parameters....Pages 206-220
Introducing institutions....Pages 221-256
A complete proof rule for strong equifair termination....Pages 257-278
Necessary and sufficient conditions for the universality of programming formalisms....Pages 279-289
There exist decidable context free propositonal dynamic logics....Pages 290-312
A decision procedure for the propositional μ-calculus....Pages 313-325
A verifier for compact parallel coordination programs....Pages 326-340
Information systems, continuity and realizability....Pages 341-359
A complete system of temporal logic for specification schemata....Pages 360-370
Reasoning in interval temporal logic....Pages 371-382
Hoare's logic for programs with procedures — What has been achieved?....Pages 383-395
A theory of probabilistic programs....Pages 396-402
A low level language for obtaining decision procedures for classes of temporal logics....Pages 403-420
Deriving efficient graph algorithms (summary)....Pages 421-441
An introduction to specification logic....Pages 442-442
An interval-based temporal logic....Pages 443-457
Property preserving homomorphisms of transition systems....Pages 458-473
From denotational to operational and axiomatic semantics for ALGOL-like languages: An overview....Pages 474-500
Yet another process logic....Pages 501-512
A proof system for partial correctness of dynamic networks of processes....Pages 513-527
Errata....Pages 528-528