Dexter Kozen (Ed.):
Logics of Programs, Workshop, Yorktown Heights, New York, May 1981.
Lecture Notes in Computer Science 131 Springer 1982, ISBN 3-540-11212-X 
- Krzysztof R. Apt, Ernst-Rüdiger Olderog:
Proof Rules Dealing with Fairness.
1-8
- Jan A. Bergstra, Anna Chmielinska, Jerzy Tiuryn:
Hoare's Logic is Incomplete When It Does Not Have To Be.
9-23
- Jan A. Bergstra, J. V. Tucker:
The Refinement of Specifications and the Stabiliy of Hoare's Logic.
24-36
- Robert Cartwright:
Toward a Logical Thoery of Program Data.
37-51
- Edmund M. Clarke, E. Allen Emerson:
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic.
52-71
- Robert L. Constable, Daniel R. Zlatin:
The Type Theory of PL/CV 3.
72-93
- J. W. de Bakker, Jan Willem Klop, John-Jules Ch. Meyer:
Correctness of Programs with Function Procedures.
94-112
- Willem P. de Roever:
A Formalism for Reasoning about Fair Termination.
113-121
- Brent Hailpern:
Keeping a Foot on the Ground (position paper).
122-123
- David Harel, Amir Pnueli, Jonathan Stavi:
Further Results on Propositional Dynamic Logic of Nonregular Programs.
124-136
- Theo M. V. Janssen, Peter van Emde Boas:
Some Observations on Compositional Semantics.
137-149
- A. J. Kfoury:
Some Connections Between iterative Programs, Recursive Programs, and First-Order Logic.
150-166
- Dexter Kozen:
On Induction vs. *-Continuity.
167-176
- Leslie Lamport:
TIMESETS -- A New Method for Temporal Reasoning about Programs.
177-196
- Leslie Lamport, Susan S. Owicki:
Program Logics and Program Verification (position paper).
197-199
- Zohar Manna, Amir Pnueli:
Verification of Concurrent Programs: Temporal Proof Principles.
200-252
- Zohar Manna, Pierre Wolper:
Synthesis of Communicating Processes from Temporal Logic Specifications.
253-281
- Albert R. Meyer, Jerzy Tiuryn:
A Note On Equivalences Among Logics of Programs.
282-299
- Grazyna Mirkowska:
The Representation Theorem for Algorithmic Algebras.
300-310
- István Németi:
Nonstandard Dynamic Logic.
311-348
- Michael J. O'Donnell:
A Critique of the Foundations of Hoare-Style Programming Logics.
349-374
- Rohit Parikh:
Some Applications of Topology to Program Semantics.
375-386
- Vaughan R. Pratt:
Using Graphs to Understand PDL.
387-396
- Andrzej Salwicki:
Critical Remarks on MAX Model of Concurrency.
397-405
Last update Thu May 24 04:37:13 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
