Logics of Programs 1985:
Brooklyn College,
New York,
NY,
USA
Rohit Parikh (Ed.):
Logics of Programs, Conference, Brooklyn College, June 17-19, 1985, Proceedings.
Lecture Notes in Computer Science 193 Springer 1985, ISBN 3-540-15648-8 
- Martín Abadi, Zohar Manna:
Nonclausal Temporal Deduction.
1-15
- Irina Bercovici:
Unsolvable Terms in Typed Lambda Calculus with Fixpoint Operators (Extended Abstract).
16-22
- Val Breazu-Tannen, Albert R. Meyer:
Lambda Calculus with Constrained Types (Extended Abstract).
23-40
- Stephen D. Brookes:
An Axiomatic Treatment of a Parallel Programming Language.
41-60
- Robert L. Constable, N. P. Mendler:
Recursive Definitions in Type Theory.
61-78
- E. Allen Emerson:
Automata, Tableaux and Temporal Logics (Extended Abstract).
79-88
- Nissim Francez, Orna Grumberg, Shmuel Katz, Amir Pnueli:
Proving Termination of Prolog Programs.
89-105
- Andreas Goerdt:
A Hoare Calculus for Functions Defined by Recursion on Higher Types.
106-117
- Michal Grabowski:
On the Relative Incompleteness of Logics for Total Correctness.
118-127
- Susanne Graf, Joseph Sifakis:
Frm Synchronization Tree Logic to Acceptance Model Logic.
128-142
- Samuel N. Kamin:
A FASE Specification of FP.
143-152
- Phokion G. Kolaitis:
On Asymptotic Probability of Inductive Queries and Their Decision Problem.
153-166
- Ron Koymans, R. K. Shyamasundar, Willem P. de Roever, Rob Gerth, S. Arun-Kumar:
Compositional Semantics for Real-time Distributed Computing.
167-189
- Daniel Leivant:
Partial-Correctness Theories as First-Order Theories.
190-195
- Orna Lichtenstein, Amir Pnueli, Lenore D. Zuck:
The Glory of the Past.
196-218
- Albert R. Meyer, Mitchell Wand:
Continuation Semantics in Typed Lambda-Calculi (Summary).
219-224
- John C. Mitchell, Albert R. Meyer:
Second-Order Logical Relations (Extended Abstract).
225-236
- Van Nguyen, Alan J. Demers, David Gries, Susan S. Owicki:
Behavior: A Temporal Approach to Process Modelling.
237-254
- Michael J. O'Donnell:
Equational Logic as a Programming Language.
255
- Rohit Parikh, Ramaswamy Ramanujam:
Distributed Processes and the Logic of Knowledge.
256-268
- Vaughan R. Pratt:
Some Constructions for Order-Theoretic Models of Concurrency.
269-283
- Ramaswamy Ramanujam, Kamal Lodaya:
Proving Fairness of Schedulers.
284-301
- Ildikó Sain:
The Reasoning Powers of Burstall's (Modal Logic) and Pnueli's (Temporal Logic) Program Verification Methods.
302-342
- Ann E. Kelley Sobel, Neelam Soundararajan:
A Proof System for Distributed Processes.
343-358
- Robert S. Streett:
Fixpoints and Program Looping: Reductions form the Propositional MU-Calculus into Propositional Dynamic Logics of Looping.
359-372
- Robert D. Tennent:
Semantical Analysis of Specification Logic.
373-386
- Andrzej Trybulec, Howard A. Blair:
Computer Aider Reasoning.
406-412
- Moshe Y. Vardi:
The Taming of Converse: Reasoning about Two-way Computations.
413-423
Copyright © Tue Dec 1 16:22:17 2009
by Michael Ley (ley@uni-trier.de)
