Equational logic as a programming language
Equational logic as a programming language
Algebraic approaches to program semantics
Algebraic approaches to program semantics
Semantic models for total correctness and fairness
Proceedings of the fifth international conference on Mathematical foundations of programming semantics
A semiring on convex polygons and zero-sum cycle problems
SIAM Journal on Computing
Methods and logics for proving programs
Handbook of theoretical computer science (vol. B)
Floyd-Hoare logic in iteration theories
Journal of the ACM (JACM)
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Effective Axiomatizations of Hoare Logics
Journal of the ACM (JACM)
An axiomatic basis for computer programming
Communications of the ACM
Algebraic Semantics of Imperative Programs
Algebraic Semantics of Imperative Programs
Program Correctness and Matricial Iteration Theories
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Kleene Algebra with Tests: Completeness and Decidability
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
A practical decision method for propositional dynamic logic (Preliminary Report)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The Complexity of Kleene Algebra with Tests
The Complexity of Kleene Algebra with Tests
A note on the complexity of propositional Hoare logic
ACM Transactions on Computational Logic (TOCL)
Certification of Compiler Optimizations Using Kleene Algebra with Tests
CL '00 Proceedings of the First International Conference on Computational Logic
The Equational Theory of Fixed Points with Applications to Generalized Language Theory
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
From Kleene Algebra to Refinement Algebra
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Substructural logic and partial correctness
ACM Transactions on Computational Logic (TOCL)
Some results in dynamic model theory
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Algebras of modal operators and partial correctness
Theoretical Computer Science - Algebraic methodology and software technology
ACM Transactions on Computational Logic (TOCL)
Automated Reasoning in Kleene Algebra
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Domain Axioms for a Family of Near-Semirings
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
A general framework for sound and complete Floyd-Hoare logics
ACM Transactions on Computational Logic (TOCL)
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Automatic proof generation in Kleene algebra
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Partial, total and general correctness
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Unifying recursion in partial, total and general correctness
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
Automating algebraic methods in isabelle
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
On the representation of kleene algebras with tests
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
An axiomatization of arrays for kleene algebra with tests
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Proof abstraction for imperative languages
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
An efficient coq tactic for deciding kleene algebras
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
The laws of programming unify process calculi
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Unifying correctness statements
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Deciding regular expressions (in-)equivalence in coq
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
A characterisation of languages on infinite alphabets with nominal regular expressions
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Extended designs algebraically
Science of Computer Programming
Kleene algebra with tests and coq tools for while programs
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
A Relatively Complete Generic Hoare Logic for Order-Enriched Effects
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We show that Kleene algebra with tests (KAT) subsumes propositional Hoare logic (PHL). Thus the specialized syntax and deductive apparatus of Hoare logic are inessential and can be replaced by simple equational reasoning. In addition, we show that all relationally valid inference rules are derivable in KAT and that deciding the relational validity of such rules is PSPACE-complete.