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