Dexter Kozen, Jerzy Tiuryn  Home/Search
Context
Related
| cornell.edu/kozen/papers/JT.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cornell.edu/kozen/papers...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We investigate the completeness of Hoare logic on the propositional level. In particular, the expressiveness requirements of Cook's proof are characterized propositionally. We give a completeness result for propositional Hoare logic (PHL): all relationally valid rules fb1g p1 fc1g; : : : ; fbng pn fcng fbg p fcg are derivable in PHL, provided the propositional expressiveness conditions are met. Moreover, if the programs p i in the premises are atomic, no expressiveness assumptions are... (Update)
Active bibliography (related documents): More All
1.4: Dynamic Logic - Harel, Kozen, Tiuryn (1984) (Correct)
0.8: A Fully Equational Proof of Parikh's Theorem - Aceto, Esik, Ingolfsdottir (2001) (Correct)
0.5: Deriving Denotational Semantics from Axiomatic Semantics.. - Lewington, Henson (Correct)
Similar documents based on text: More All
0.6: On Hoare Logic, Kleene Algebra, and Types - Kozen (1999) (Correct)
0.6: On Hoare Logic and Kleene Algebra with Tests - Kozen (1998) (Correct)
0.3: Equational Axiomatization of Bicoercibility for Polymorphic Types - Tiuryn (1995) (Correct)
BibTeX entry: (Update)
@article{ kozen01completeness,
author = "Dexter Kozen and Jerzy Tiuryn",
title = "On the completeness of propositional Hoare logic",
journal = "Information Sciences",
volume = "139",
number = "3-4",
pages = "187-195",
year = "2001",
url = "citeseer.ist.psu.edu/kozen01completeness.html" }
Citations (may not include all citations):650 An axiomatic basis for computer programming (context) - Hoare - 1969
195 Propositional dynamic logic of regular programs (context) - Fischer, Ladner - 1979
143 Logics of programs (context) - Kozen, Tiuryn - 1990
95 Verification of Sequential and Concurrent Programs (context) - Apt, Olderog - 1991
51 Soundness and completeness of an axiom system for program ve.. (context) - Cook - 1978
49 Methods and logics for proving programs (context) - Cousot - 1990
22 Programming language constructs for which it is impossible t.. (context) - Clarke - 1979
14 On Hoare logic and Kleene algebra with tests - Kozen - 1999
14 On Hoare logic and Kleene algebra with tests - Kozen - 1999
12 Transactions on Programming Languages and Systems (context) - Kozen, with - 1997
12 Existential fixed-point logic (context) - Blass, Gurevich - 1987
6 A new incompleteness result for Hoare's system (context) - Wand - 1978
4 The deducibility problem in propositional dynamic logic (context) - Meyer, Streett et al. - 1981
3 Floyd--Hoare logic in iteration theories (context) - Bloom, Esik - 1991
3 Program correctness and matricial iteration theories (context) - Bloom, Esik - 1992
3 A necessary and sufficient condition for the existence of Ho.. (context) - Lipton - 1977
3 Methodology and Philosophy of Science (context) - Kozen, logic et al. - 1999
1 Programming Languages and Systems (context) - Apt, of et al. - 1981
Documents on the same site (http://www.cs.cornell.edu/kozen/papers/papers.html): More
Efficient Algorithms for Optimal Video Transmission - Dexter Kozen (1995) (Correct)
Parikh's Theorem in Commutative Kleene Algebra - Hopkins, Kozen (1999) (Correct)
Partial Automata and Finitely Generated Congruences: An Extension.. - Kozen (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC