Abstract is missing.
- A Static Analysis of CSP ProgramsKrzysztof R. Apt. 1-17
- Compactness in Semantics for Merge and Fair MergeJ. W. de Bakker, Jeffery I. Zucker. 18-33
- Algebraic Tools for System ConstructionJan A. Bergstra, Jan Willem Klop, J. V. Tucker. 34-44
- PC-Compactness, a Necessary Condition for the Existence of Sound and Complete Logics of Partial CorrectnessJan A. Bergstra, Jerzy Tiuryn. 45-56
- The Intractability of Validity in Logic Programming and Dynamic LogicHoward A. Blair. 57-67
- A Semantics and Proof System for Communicating ProcessesStephen D. Brookes. 68-85
- Non-Standard Fixed Points in First Order LogicRobert Cartwright. 86-100
- Automatic Verification of Asynchronous CircuitsEdmund M. Clarke, Bud Mishra. 101-115
- Mathematics as ProgrammingRobert L. Constable. 116-128
- Characterization of Acceptable by ALGOL-Like Programming LanguagesCh. Crasemann, Hans Langmaack. 129-146
- A Rigorous Approach to Fault-Tolerant System Development (Extended Abstract)Flaviu Cristian. 147-160
- A Sound and Relatively* Compete Axiomatization of Clarke s Language L::4::Werner Damm, Bernhard Josko. 161-175
- Deciding Branching Time Logic: A Triple Exponential Decision Procedure for CTL*E. Allen Emerson, A. Prasad Sistla. 176-192
- Equation in Combinatory AlgebrasErwin Engeler. 193-205
- Reasoning About Procedures as ParametersSteven M. German, Edmund M. Clarke, Joseph Y. Halpern. 206-220
- Introducing InstitutionsJoseph A. Goguen, Rod M. Burstall. 221-256
- A Compete Proof Rule for Strong Equifair TerminationOrna Grumberg, Nissim Francez, Shmuel Katz. 257-278
- Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report)A. J. Kfoury, Pawel Urzyczyn. 279-289
- There Exit Decidable Context Free Propositional Dynamic LogicsTmima Koren, Amir Pnueli. 290-312
- A Decision Procedure for the Propositional µ-CalculusDexter Kozen, Rohit Parikh. 313-325
- A Verifier for Compact Parallel Coordination ProgramsBoris D. Lubachevsky. 326-340
- Information Systems, Continuity and RealizabilityCharles McCarty. 341-259
- A Complete System of Temporal Logic for Specification SchemataJohn McLean. 360-370
- Reasoning in Interval Temporal LogicBen C. Moszkowski, Zohar Manna. 371-382
- Hoare s Logic for Programs with Procedures - What Has Been Achieved?Ernst-RĂ¼diger Olderog. 383-395
- A Theory of Probabilistic ProgramsRohit Parikh, Anne Mahoney. 396-402
- A Low Level Language for Obtaining Decision Procedure for Classes of temporal LogicsDavid A. Plaisted. 403-420
- Deriving Efficient Graph Algorithms (Summary)John H. Reif, William L. Scherlis. 421-441
- An Introduction to Specification LogicJohn C. Reynolds. 442
- An Interval-Based Temporal LogicRichard L. Schwartz, P. M. Melliar-Smith, Friedrich H. Vogt. 443-457
- Property Preserving Homomorphisms of Transition SystemsJoseph Sifakis. 458-473
- From Denotational to Operational and Axiomatic Semantics for ALGOL-like Languages: an OverviewBoris A. Trakhtenbrot, Joseph Y. Halpern, Albert R. Meyer. 474-500
- Yet Another Process Logic (Preliminary Version)Moshe Y. Vardi, Pierre Wolper. 501-512
- A Proof System for Partial Correctness of Dynamic Networks of Processes (Extended Abstract)Job Zwiers, Arie de Bruin, Willem P. de Roever. 513-527