Logics of Programs: Workshop, Yorktown Heights, New York, May 1981

Proof rules dealing with fairness....Pages 1-8
Hoare\'s Logic is incomplete when it does not have to be....Pages 9-23
The refinement of specifications and the stability of Hoare\'s Logic....Pages 24-36
Toward a logical theory of program data....Pages 37-51
Design and synthesis of synchronization skeletons using branching time temporal logic....Pages 52-71
The type theory of PL/CV3....Pages 72-93
Correctness of programs with function procedures....Pages 94-112
A formalism for reasoning about fair termination....Pages 113-121
Keeping a foot on the ground....Pages 122-123
Further results on propositional dynamic logic of nonregular programs....Pages 124-136
Some observations on compositional semantics....Pages 137-149
Some connections between iterative programs, recursive programs, and first-order logic....Pages 150-166
On induction vs. *-continuity....Pages 167-176
Timesets....Pages 177-196
Program logics and program verification....Pages 197-199
Verification of concurrent programs: Temporal proof principles....Pages 200-252
Synthesis of communicating processes from Temporal Logic specifications....Pages 253-281
A note on equivalences among logics of programs....Pages 282-299
The representation theorem for algorithmic algebras....Pages 300-310
Nonstandard Dynamic Logic....Pages 311-348
A critique of the foundations of Hoare-style programming logics....Pages 349-374
Some applications of topology to program semantics....Pages 375-386
Using graphs to understand PDL....Pages 387-396
Critical remarks on max model of concurrency....Pages 397-405
Transcript of panel discussion....Pages 406-429