Edmund M. Clarke, Dexter Kozen (Eds.):
Logics of Programs, Workshop, Carnegie Mellon University, Pittsburgh, PA, USA, June 6-8, 1983, Proceedings.
Lecture Notes in Computer Science 164 Springer 1984, ISBN 3-540-12896-4 
- Krzysztof R. Apt:
A Static Analysis of CSP Programs.
1-17
- J. W. de Bakker, Jeffery I. Zucker:
Compactness in Semantics for Merge and Fair Merge.
18-33
- Jan A. Bergstra, Jan Willem Klop, J. V. Tucker:
Algebraic Tools for System Construction.
34-44
- Jan A. Bergstra, Jerzy Tiuryn:
PC-Compactness, a Necessary Condition for the Existence of Sound and Complete Logics of Partial Correctness.
45-56
- Howard A. Blair:
The Intractability of Validity in Logic Programming and Dynamic Logic.
57-67
- Stephen D. Brookes:
A Semantics and Proof System for Communicating Processes.
68-85
- Robert Cartwright:
Non-Standard Fixed Points in First Order Logic.
86-100
- Edmund M. Clarke, Bud Mishra:
Automatic Verification of Asynchronous Circuits.
101-115
- Robert L. Constable:
Mathematics as Programming.
116-128
- Ch. Crasemann, Hans Langmaack:
Characterization of Acceptable by ALGOL-Like Programming Languages.
129-146
- Flaviu Cristian:
A Rigorous Approach to Fault-Tolerant System Development (Extended Abstract).
147-160
- Werner Damm, Bernhard Josko:
A Sound and Relatively* Compete Axiomatization of Clarke's Language L4.
161-175
- E. Allen Emerson, A. Prasad Sistla:
Deciding Branching Time Logic: A Triple Exponential Decision Procedure for CTL*.
176-192
- Erwin Engeler:
Equation in Combinatory Algebras.
193-205
- Steven M. German, Edmund M. Clarke, Joseph Y. Halpern:
Reasoning About Procedures as Parameters.
206-220
- Joseph A. Goguen, Rod M. Burstall:
Introducing Institutions.
221-256
- Orna Grumberg, Nissim Francez, Shmuel Katz:
A Compete Proof Rule for Strong Equifair Termination.
257-278
- A. J. Kfoury, Pawel Urzyczyn:
Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report).
279-289
- Tmima Koren, Amir Pnueli:
There Exit Decidable Context Free Propositional Dynamic Logics.
290-312
- Dexter Kozen, Rohit Parikh:
A Decision Procedure for the Propositional µ-Calculus.
313-325
- Boris D. Lubachevsky:
A Verifier for Compact Parallel Coordination Programs.
326-340
- Charles McCarty:
Information Systems, Continuity and Realizability.
341-259
- John McLean:
A Complete System of Temporal Logic for Specification Schemata.
360-370
- Ben C. Moszkowski, Zohar Manna:
Reasoning in Interval Temporal Logic.
371-382
- Ernst-Rüdiger Olderog:
Hoare's Logic for Programs with Procedures - What Has Been Achieved?.
383-395
- Rohit Parikh, Anne Mahoney:
A Theory of Probabilistic Programs.
396-402
- David A. Plaisted:
A Low Level Language for Obtaining Decision Procedure for Classes of temporal Logics.
403-420
- John H. Reif, William L. Scherlis:
Deriving Efficient Graph Algorithms (Summary).
421-441
- John C. Reynolds:
An Introduction to Specification Logic.
442
- Richard L. Schwartz, P. M. Melliar-Smith, Friedrich H. Vogt:
An Interval-Based Temporal Logic.
443-457
- Joseph Sifakis:
Property Preserving Homomorphisms of Transition Systems.
458-473
- Boris A. Trakhtenbrot, Joseph Y. Halpern, Albert R. Meyer:
From Denotational to Operational and Axiomatic Semantics for ALGOL-like Languages: an Overview.
474-500
- Moshe Y. Vardi, Pierre Wolper:
Yet Another Process Logic (Preliminary Version).
501-512
- Job Zwiers, Arie de Bruin, Willem P. de Roever:
A Proof System for Partial Correctness of Dynamic Networks of Processes (Extended Abstract).
513-527
Copyright © Mon Dec 14 20:16:10 2009
by Michael Ley (ley@uni-trier.de)
