Models of program logics
Vaughan Pratt · Annual Symposium on Foundations of Computer Science · 1979
We briefly survey the major proposals for models of programs and show that they all lead to the same propositional theory of programs. Methods of algebraic logic dominate in the proofs. One of the connections made between the models, that involving language models, is quite counterintuitive. The common theory has already been shown to be complete in deterministic exponential time; we give here a simpler proof of the upper bound.
Cited by 198 works. doi:10.1109/sfcs.1979.24
Authors
References
- A Discipline of Programming
- An axiomatic basis for computer programming
- Assigning meanings to programs
- Propositional modal logic of programs
- Consistent and complementary formal theories of the semantics of programming languages
- Regular algebra and finite machines
- A near-optimal method for reasoning about action
- On the formal description of PL/I
- On the theory of programming logics
- A. Salwicki. Formalized algorithmic languages. English with English and Russian summaries. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 18 (1970), pp. 227–232, XVII, XVII. - A. Salwicki. On the equivalence of FS-expressions and programs. English with English and Russian summaries. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 18 (1970), pp. 275–278, XXI, XXI. - A. Salwicki. On the predicate calculi with iteration quantifiers. English with English and Russian summaries. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 18 (1970), pp. 279–285, XXI, XXI.