Refinement Trees: Calculi, Tools, and Applications
We recall a language for refinement and branching of formal developments. We introduce a notion of refinement tree and present proof calculi for checking correctness of refinements as well as their consistency. Both calculi have been implemented in the Heterogeneous Tool Set (Hets), and have been integrated with other tools like model finders and conservativity checkers. This technique has already been applied for showing the consistency of a first-order ontology that is too large to be tackled directly by model finders.
Unable to display preview. Download preview PDF.
- 1.Abrial, J.-R., Börger, E., Langmaack, H.: Formal Methods for Industrial Applications, Specifying and Programming the Steam Boiler Control. LNCS, vol. 1165. Springer, Heidelberg (1996)Google Scholar
- 2.Astesiano, E., Kreowski, H.-J., Krieg-Brückner, B.: Algebraic Foundations of Systems Specification. Springer, Heidelberg (1999)Google Scholar
- 6.Codescu, M.: Lambda Expressions in CASL Architectural Specifications. In: Mossakowski, T., Kreowski, H.-J. (eds.) 20th International Workshop on Recent Trends in Algebraic Development Techniques, WADT 2010. LNCS. Springer, Heidelberg (2011)Google Scholar
- 9.Hoffman, P.: Architectural Specifications and Their Verification. PhD thesis, Warsaw University (2005)Google Scholar
- 10.Kutz, O., Mossakowski, T.: A modular consistency proof for Dolce. In: 25th Conference on Artificial Intelligence, AAAI 2011 (to appear, 2011)Google Scholar
- 11.Liu, M.: Konsistenz-Check von CASL-Spezifikationen. Master’s thesis, University of Bremen (2008)Google Scholar
- 16.Pease, A.: The SUMO challenges, http://www.cs.miami.edu/~tptp/SUMOChallenge/