Fixed points in free process algebras: Part I
Theoretical Computer Science
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
A classical mind
Ordered chaining calculi for first-order theories of transitive relations
Journal of the ACM (JACM)
Two Complete Axiom Systems for the Algebra of Regular Events
Journal of the ACM (JACM)
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
A Method for Refining Atomicity in Parallel Algorithms
PARLE '89 Proceedings of the Parallel Architectures and Languages Europe, Volume II: Parallel Languages
ZUM '97 Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation
On the Semantics of Fair Parallelism
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
Abstract Model Checking of Infinite Specifications
FME '94 Proceedings of the Second International Symposium of Formal Methods Europe on Industrial Benefit of Formal Methods
From Kleene Algebra to Refinement Algebra
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Handbook of automated reasoning
Handbook of automated reasoning
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Automated Element-Wise Reasoning with Sets
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Algebras of modal operators and partial correctness
Theoretical Computer Science - Algebraic methodology and software technology
Verifying data refinements using a model checker
Formal Aspects of Computing
ACM Transactions on Computational Logic (TOCL)
Automated Reasoning in Kleene Algebra
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Diagram Chase in Relational System Development
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic refinement checking for b
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Using probabilistic kleene algebra for protocol verification
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
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
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Domain Axioms for a Family of Near-Semirings
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Enabledness and termination in refinement algebra
Science of Computer Programming
Automated verification of refinement laws
Annals of Mathematics and Artificial Intelligence
Reasoning about a distributed probabilistic system
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
An algebra of product families
Software and Systems Modeling (SoSyM)
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
| Hi-index | 0.00 |
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on Kleene algebras in an off the shelf resolution and paramodulation theorem prover and a counterexample checker with heuristics for hypothesis learning. The proofs are supported by a toolkit of meaningful refinement laws that has also been verified and that, for the first time, allows the refinement of programs and software systems, and the verification of further complex refinement laws, by automated deduction. This suggests that a substantial proportion of refinement could indeed be automated.