Logics of time and computation
Logics of time and computation
Program inversion in the refinement calculus
Information Processing Letters
Program inversion: more than fun!
Science of Computer Programming
Downward refinement and the efficiency of hierarchical problem solving
Artificial Intelligence
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Object-oriented software construction (2nd ed.)
Object-oriented software construction (2nd ed.)
Ten Years of Hoare's Logic: A Survey—Part I
ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming
Communications of the ACM
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Verifying Probabilistic Programs Using a Hoare like Logic
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
LOGICS OF PROGRAMS: AXIOMATICS AND DESCRIPTIVE POWER
LOGICS OF PROGRAMS: AXIOMATICS AND DESCRIPTIVE POWER
Formalizing the analysis of algorithms.
Formalizing the analysis of algorithms.
An Observationally Complete Program Logic for Imperative Higher-Order Frame Rules
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Polymorphism and separation in hoare type theory
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Reasoning about probabilistic sequential programs
Theoretical Computer Science
The Spec# Programming System: Challenges and Directions
Verified Software: Theories, Tools, Experiments
Who: a verifier for effectful higher-order programs
Proceedings of the 2009 ACM SIGPLAN workshop on ML
Elimination of ghost variables in program logics
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Information modeling for end to end composition of semantic web services
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
ESC/Java2: uniting ESC/Java and JML
CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
| Hi-index | 0.00 |
We present a novel Hoare-style logic, called Reverse Hoare Logic, which can be used to reason about state reachability of imperative programs. This enables us to give natural specifications to randomized (deterministic or nondeterministic) algorithms. We give a proof system for the logic and use this to give simple formal proofs for a number of illustrative examples. We define a weakest postcondition calculus and use this to show that the proof system is sound and complete.