Skip to main content
SpringerLink
Log in

Refinement Trees: Calculi, Tools, and Applications

  • Conference paper
Algebra and Coalgebra in Computer Science (CALCO 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6859))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

  3. Bidoit, M., Mosses, P.D. (eds.): CASL User Manual. LNCS, vol. 2900. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  4. Bidoit, M., Sannella, D., Tarlecki, A.: Architectural specifications in CASL. Formal Aspects of Computing 13, 252–273 (2002)

    Article  MATH  Google Scholar 

  5. Bidoit, M., Sannella, D., Tarlecki, A.: Observational interpretation of Casl specifications. Mathematical Structures in Computer Science 18(2), 325–371 (2008)

    Article  MathSciNet  MATH  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 

  7. Gangemi, A., Guarino, N., Masolo, C., Oltramari, A., Schneider, L.: Sweetening ontologies with DOLCE. In: Gómez-Pérez, A., Benjamins, V.R. (eds.) EKAW 2002. LNCS (LNAI), vol. 2473, pp. 166–181. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Goguen, J.A., Burstall, R.M.: Institutions: Abstract model theory for specification and programming. Logic of Programs 1983 39, 95–146 (1992); Predecessor in: LNCS. vol. 164, pp. 221–256 (1984)

    MathSciNet  MATH  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 

  12. Mossakowski, T., Autexier, S., Hutter, D.: Development graphs – proof management for structured specifications. Journal of Logic and Algebraic Programming 67(1-2), 114–145 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Mossakowski, T., Sannella, D., Tarlecki, A.: A simple refinement language for casl. In: Fiadeiro, J.L., Mosses, P.D., Yu, Y. (eds.) WADT 2004. LNCS, vol. 3423, pp. 162–185. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Mossakowski, T., Maeder, C., Lüttich, K.: The Heterogeneous Tool Set, Hets. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 519–522. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Mosses, P.D. (ed.): CASL Reference Manual. LNCS, vol. 2960. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  16. Pease, A.: The SUMO challenges, http://www.cs.miami.edu/~tptp/SUMOChallenge/

  17. Roggenbach, M., Schröder, L.: Towards Trustworthy Specifications I: Consistency Checks. In: Cerioli, M., Reggio, G. (eds.) WADT 2001 and CoFI WG Meeting 2001. LNCS, vol. 2267, p. 305. Springer, Heidelberg (2002), http://www.springer.de

    Chapter  Google Scholar 

  18. Sannella, D., Tarlecki, A.: Toward formal development of programs from algebraic specifications: implementations revisited. Acta Informatica 25, 233–281 (1988)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DFKI GmbH, Bremen, Germany

    Mihai Codescu & Till Mossakowski

Authors
  1. Mihai Codescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Till Mossakowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, 56127, Pisa, Italy

    Andrea Corradini

  2. Faculty of Mathematics, Informatics, and Mechanics, University of Warsaw, ul. Banacha 2, 02-097, Warszawa, Poland

    Bartek Klin

  3. School of Electronics and Computer Science, University of Southampton, SO17 1BJ, Southampton, UK

    Corina Cîrstea

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Codescu, M., Mossakowski, T. (2011). Refinement Trees: Calculi, Tools, and Applications. In: Corradini, A., Klin, B., Cîrstea, C. (eds) Algebra and Coalgebra in Computer Science. CALCO 2011. Lecture Notes in Computer Science, vol 6859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22944-2_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22944-2_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22943-5

  • Online ISBN: 978-3-642-22944-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation