Can Refinement be Automated?

Electronic Notes in Theoretical Computer Science

Volumn 201, Issue C, 2008, Pages 197-222

  Höfner, Peter ^a   Struth, Georg ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

action systems; automated deduction; Kleene algebras; proof learning; refinement calculus

Indexed keywords

COMPUTER AIDED SOFTWARE ENGINEERING; DATA REDUCTION; LEARNING SYSTEMS; PROBLEM SOLVING; THEOREM PROVING;

AUTOMATED DEDUCTION; KLEENE ALGEBRAS; PROOF LEARNING; REFINEMENT CALCULUS;

AUTOMATIC PROGRAMMING;

EID: 40149108893     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.02.021     Document Type: Article

References (36)

1. http://www.dcs.shef.ac.uk/~georg/ka
2. Atelier B. http://www.atelierb.societe.com
3. B-Core(UK) Ltd. The B-Tool. http://www.b-core.com/btool.html
4. Bachmair L., and Ganzinger H. Ordered chaining calculi for first-order theories of transitive relations. J. ACM 45 (1998) 1007-1049
5. Back R.-J. A method for refining atomicity in parallel algorithms. In: Odijk E., Rem M., and Syr J.-C. (Eds). Parallel Architectures and Languages Europe. Lecture Notes in Computer Science 366 (1989) 199-216
6. Back R.-J., and von Wright J. Refinement Calculus: A Systematic Introduction. Graduate Texts in Computer Science (1998), Springer
7. Back R.-J., and von Wright J. Reasoning algebraically about loops. Acta Informatica 36 (1999) 295-334
8. Benson D.B., and Tiuryn J. Fixed points in free process algebras, Part I. Theoretical Computer Science 63 (1989) 275-294
9. Butler M. On the use of data refinement in the development of secure communication systems. Formal Aspects of Computing 14 (2002) 2-34
10. Butler M., Grundy J., Långbacka T., Rukšėnas R., and von Wright J. The refinement calculator: Proof support for program refinement. In: Groves L., and Reeves S. (Eds). Formal Methods Pacific'97 (1997), Springer 40-61
11. Conway J.H. Regular Algebra and Finite Machines (1971), Chapman & Hall
12. Desharnais J., Möller B., and Struth G. Kleene algebra with domain. ACM Trans. Computational Logic 7 (2006) 798-833
13. Ebert M., and Struth G. Diagram chase in relational system development. In: Minas M. (Ed). 3rd IEEE Workshop on Visual Languages and Formal Methods. Elecronic Notes in Theoretical Computer Science 127 (2005) 87-105
14. Formal Systems (Europe) Limited. FDR2. http://www.fsel.com
15. Höfner P., and Struth G. Automated reasoning in Kleene algebra. CADE 2007. Lecture Notes in Artificial Intelligence 4603 (2007) 279-294
16. Jackson D. Abstract model checking of infinite specifications. In: Naftalin M., Denvir T., and Bertran M. (Eds). FME '94. Lecture Notes in Computer Science 873 (1994) 519-531
17. Kozen D. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation 110 (1994) 366-390
18. Leuschel M., and Butler M. Automatic refinement checking for b. In: Lau K.-K., and Banach R. (Eds). ICFEM'05. Lecture Notes in Computer Science 3785 (2005) 345-359
19. McCune W. Prover9 and Mace4. http://www.cs.unm.edu/~mccune/prover9
20. McIver A.K., Cohen E., and Morgan C.C. Using probabilistic Kleene algebra for protocol verification. In: Schmidt R.A. (Ed). Relations and Kleene Algebra in Computer Science. Lecture Notes in Computer Science 4136 (2006) 296-310
21. Möller B., and Struth G. Algebras of modal operators and partial correctness. Theoretical Computer Science 351 (2006) 221-239
22. Park D. On the semantics of fair parallelism. In: Bjørner D. (Ed). Abstract Software Specifications. Lecture Notes in Computer Science 86 (1980) 504-526
23. In: Robinson J.A., and Voronkov A. (Eds). Handbook of Automated Reasoning (in 2 volumes) (2001), Elsevier and MIT Press
24. Robinson N.J. Incremental derivation of abstraction relations for data refinement. In: Dong J.S., and Woodcock J. (Eds). Formal Methods and Software Engineering. Lecture Notes in Computer Science 2885 (2003) 246-265
25. Roscoe A.W. Model-checking csp. In: Roscoe A.W. (Ed). A Classical Mind: Essays in Honour of C.A.R. Hoare (1994), Prentice Hall 353-378
26. Saaltink M. The z/eves system. In: Bowen J., Hinchey M., and Till D. (Eds). ZUM '97. Lecture Notes in Computer Science 1212 (1997) 72-85
27. Salomaa A. Two complete axiom systems for the algebra of regular events. J. ACM 13 (1966) 158-169
28. Smith G., and Derrick J. Verifying data refinements using a model checker. Formal Aspects of Computing 18 (2006) 264-287
29. Struth G. A calculus for set-based program development. In: Dong J.S., and Woodcock (Eds). Formal Methods and Software Engineering. Lecture Notes in Computer Science 2885 (2003) 541-559
30. Struth G. Automated element-wise reasoning with sets. In: Cuellar J.R., and Liu Z. (Eds). Proc. SEFM 2004 (2004) 320-329
31. Struth G. Abstract abstract reduction. Journal of Logic and Algebraic Programming 66 (2006) 239-270
32. Takai T., and Furusawa H. Monodic tree Kleene algebra. In: Schmidt R.A. (Ed). Relations and Kleene Algebra in Computer Science. Lecture Notes in Computer Science 4136 (2006) 402-416
33. In: Terese (Ed). Term Rewriting Systems (2003), Cambridge University Press
34. von Wright, J., Program refinement by theorem prover, in: 6th Refinement Workshop (1994)
35. von Wright J. From Kleene algebra to refinement algebra. In: Boiten E.A., and Möller B. (Eds). Mathematics of Program Construction. Lecture Notes in Computer Science 2386 (2002) 233-262
36. von Wright J. Towards a refinement algebra. Science of Computer Programming 51 (2004) 23-45