Automating algebraic methods in Isabelle

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6991 LNCS, Issue , 2011, Pages 617-632

  Guttmann, Walter ^a   Struth, Georg ^b   Weber, Tjark ^c  

^a UNIVERSITY OF ULM   (Germany)

^b UNIVERSITY OF SHEFFIELD   (United Kingdom)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC METHOD; ALGEBRAIC REASONING; AUTOMATED THEOREM PROVER; COMPUTATIONAL LOGIC; COMPUTING SYSTEM; HOARE LOGIC; INTEGRATED TOOLS; ISABELLE; ISABELLE/HOL; SOFTWARE DEVELOPMENT METHODS; SOUNDNESS AND RELATIVE COMPLETENESS; TERMINATION THEOREMS; TOOL INTEGRATION;

AUTOMATA THEORY; AUTOMATION; FORMAL METHODS; SOFTWARE DESIGN;

ALGEBRA;

EID: 80455140616     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24559-6_41     Document Type: Conference Paper

References (29)

1. Apt, K.R., de Boer, F.S., Olderog, E.R.: Verification of Sequential and Concurrent Programs, 3rd edn. Springer, Heidelberg (2009)
2. Bachmair, L., Dershowitz, N.: Commutation, transformation, and termination. In: Siekmann, J.H. (ed.) CADE 1986. LNCS, vol. 230, pp. 5-20. Springer, Heidelberg (1986)
3. Blanchette, J.C., Böhme, S., Paulson, L.C.: Extending sledgehammer with SMT solvers. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS, vol. 6803, pp. 116-130. Springer, Heidelberg (2011)
4. Böhme, S., Weber, T.: Fast LCF-style proof reconstruction for Z3. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 179-194. Springer, Heidelberg (2010)
5. Cohen, E.: Separation and reduction. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, pp. 45-59. Springer, Heidelberg (2000)
6. Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, Boca Raton (1971)
7. Cook, S.A.: Soundness and completeness of an axiom system for program verification. SIAM J. Comput. 7(1), 70-90 (1978)
8. Desharnais, J., Möller, B., Struth, G.: Kleene algebra with domain. ACM Transactions on Computational Logic 7(4), 798-833 (2006)
9. Desharnais, J., Möller, B., Struth, G.: Algebraic notions of termination. Logical Methods in Computer Science 7(1:1), 1-29 (2011)
10. Desharnais, J., Struth, G.: Internal axioms for domain semirings. Sci. Comput. Program. 76(3), 181-203 (2011)
11. Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)
12. Doornbos, H., Backhouse, R., van der Woude, J.: A calculational approach to mathematical induction. Theor. Comput. Sci. 179(1-2), 103-135 (1997)
13. Foster, S., Struth, G.,Weber, T.: Automated engineering of relational and algebraic methods in isabelle/HOL. In: de Swart, H. (ed.) RAMICS 2011. LNCS, vol. 6663, pp. 52-67. Springer, Heidelberg (2011)
14. Haftmann, F., Wenzel, M.: Local theory specifications in isabelle/Isar. In: Berardi, S., Damiani, F., de'Liguoro, U. (eds.) TYPES 2008. LNCS, vol. 5497, pp. 153-168. Springer, Heidelberg (2009)
15. Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)
16. Hoare, C.A.R., Hayes, I.J., He, J., Morgan, C.C., Roscoe, A.W., Sanders, J.W., Sorensen, I.H., Spivey, J.M., Sufrin, B.A.: Laws of programming. Commun. ACM 30(8), 672-686 (1987)
17. Hoare, C.A.R., He, J.: Unifying theories of programming. Prentice Hall Europe (1998)
18. Höfner, P., Struth, G.: Automated reasoning in kleene algebra. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 279-294. Springer, Heidelberg (2007)
19. Höfner, P., Struth, G.: On automating the calculus of relations. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 50-66. Springer, Heidelberg (2008)
20. Höfner, P., Struth, G., Sutcliffe, G.: Automated verification of refinement laws. Annals of Mathematics and Artificial Intelligence 55(1-2), 35-62 (2009)
21. Jackson, M., Stokes, T.: Semigroups with if-then-else and halting programs. International Journal of Algebra and Computation 19(7), 937-961 (2009)
22. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation 110(2), 366-390 (1994)
23. Kozen, D.: On Hoare logic and Kleene algebra with tests. ACM Transactions on Computational Logic 1(1), 60-76 (2000)
24. Krauss, A., Nipkow, T.: Proof pearl: Regular expression equivalence and relation algebra. Journal of Automated Reasoning (2011), http://dx.doi.org/10. 1007/s10817-011-9223-4
25. Maddux, R.D.: Relation-algebraic semantics. Theor. Comput. Sci. 160(1-2), 1-85 (1996)
26. Möller, B., Struth, G.: Algebras of modal operators and partial correctness. Theor. Comput. Sci. 351(2), 221-239 (2006)
27. Nipkow, T.: Hoare logics in Isabelle/HOL. In: Schwichtenberg, H., Steinbrüggen, R. (eds.) Proofs and System-Reliability, pp. 341-367. Kluwer Academic Publishers, Dordrecht (2002)
28. Paulson, L.C., Blanchette, J.C.: Three years of experience with Sledgehammer, a practical link between automatic and interactive theorem provers. In: Sutcliffe, G., Ternovska, E., Schulz, S. (eds.) Proceedings of the 8th International Workshop on the Implementation of Logics, pp. 3-13 (2010)
29. Schirmer, N.: Verification of Sequential Imperative Programs in Isabelle/HOL. Ph.D. thesis, TU München (2006)