Skip to main content
SpringerLink
Log in

Proving Behavioral Refinements of COL-specifications

  • Chapter
Algebra, Meaning, and Computation

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

Abstract

The COL institution (constructor-based observational logic) has been introduced as a formal framework to specify both generation- and observation-oriented properties of software systems. In this paper we consider behavioral refinement relations between COL-specifications taking into account implementation constructions. We propose a general strategy for proving the correctness of such refinements by reduction to (standard) first-order theorem proving with induction. Technically our strategy relies on appropriate proof rules and on a lifting construction to encode the reachability and observability notions of the COL institution.

This work is partially supported by the GLOWA-Danube project (01LW0303A) sponsored by the German Federal Ministry of Education and Research.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Astesiano, E., Kreowski, H.-J., Krieg-Brückner, B. (eds.): Algebraic Foundations of Systems Specification. Springer, Heidelberg (1999)

    Google Scholar 

  2. Bidoit, M., Cengarle, M.-V., Hennicker, R.: Proof systems for structured specifications and their refinements. In: [1], ch. 11, pp. 385–433. Springer, Heidelberg (1999)

    Google Scholar 

  3. Bidoit, M., Hennicker, R.: Modular correctness proofs of behavioural implementations. Acta Informatica 35, 951–1005 (1998)

    Article  MathSciNet  Google Scholar 

  4. Bidoit, M., Hennicker, R.: Constructor-based observational logic. Journal of Logic and Algebraic Programming 67(1-2), 3–51 (2006), Preliminary version, available at http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BID-HEN-JLAP.pdf

    Article  MATH  MathSciNet  Google Scholar 

  5. Bidoit, M., Hennicker, R.: Behavioural theories and the proof of behavioural properties. Theoretical Computer Science 165(1), 3–55 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bidoit, M., Hennicker, R.: Observer complete definitions are behaviourally coherent. In: Proc. OBJ/CafeOBJ/Maude Workshop at Formal Methods, Toulouse, France, Septmeber, pp. 83–94. THETA (1999)

    Google Scholar 

  7. Bidoit, M., Hennicker, R.: Externalized and internalized notions of behavioral refinement. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol. 3722, pp. 334–350. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

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

    MATH  Google Scholar 

  9. Diaconescu, R., Futatsugi, K.: CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification. AMAST Series in Computing. World Scientific, Singapore (1998)

    Google Scholar 

  10. Ehrig, H., Kreowski, H.-J.: Refinement and implementation. In: [1]. ch:7, pp. 201–242. Springer, Heidelberg (1999)

    Google Scholar 

  11. Goguen, J., Meseguer, J.A.: Universal realization, persistent interconnection and implementation of abstract modules. In: Proc. ICALP 1982. LNCS, vol. 140, pp. 265–281. Springer, Heidelberg (1982)

    Google Scholar 

  12. Goguen, J., Roşu, G.: Hiding more of hidden algebra. In: Woodcock, J.C.P., Davies, J., Wing, J.M. (eds.) FM 1999. LNCS, vol. 1709, pp. 1704–1719. Springer, Heidelberg (1999)

    Google Scholar 

  13. Goguen, J., Burstall, R.: Institutions: abstract model theory for specification and programming. Journal of the ACM 39(1), 95–146 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  14. Loeckx, J., Ehrich, H.-D., Wolf, M.: Specification of Abstract Data Types. Wiley and Teubner (1996)

    Google Scholar 

  15. Malcolm, G., Goguen, J.: Proving correctness of refinement and implementation. Technical Report PRG-114, Oxford University Computing Laboratory (1994)

    Google Scholar 

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

    MATH  Google Scholar 

  17. Orejas, F., Navarro, M., Sanchez, A.: Implementation and behavioural equivalence. In: Bidoit, M., Choppy, C. (eds.) Abstract Data Types 1991 and COMPASS 1991. LNCS, vol. 655, pp. 93–125. Springer, Heidelberg (1993)

    Google Scholar 

  18. Sannella, D., Tarlecki, A.: On observational equivalence and algebraic specification. Journal of Computer and System Sciences 34, 150–178 (1987)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  20. Schoett, O.: Data abstraction and correctness of modular programming. Technical Report CST-42-87, University of Edinburgh (1987)

    Google Scholar 

  21. Tarlecki, A.: Institutions: An Abstract Framework for Formal Specification. In: [1], ch. 4, pp. 105–130. Springer, Heidelberg (1999)

    Google Scholar 

  22. Wirsing, M.: Algebraic Specification. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 3, pp. 676–788. Elsevier Science Publishers B.V, Amsterdam (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire Spécification et Vérification (LSV), CNRS & ENS de Cachan, France

    Michel Bidoit

  2. Institut für Informatik, Ludwig-Maximilians-Universität München, Germany

    Rolf Hennicker

Authors
  1. Michel Bidoit
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rolf Hennicker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Japan Advanced Institute of Science and Technology (JAIST),  

    Kokichi Futatsugi

  2. LIX, Projet INRIA TypiCal, École Polytechnique and CNRS, 91400, Palaiseau, France

    Jean-Pierre Jouannaud

  3. CS Dept., University of Illinois at Urbana-Champaign, USA

    José Meseguer

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bidoit, M., Hennicker, R. (2006). Proving Behavioral Refinements of COL-specifications. In: Futatsugi, K., Jouannaud, JP., Meseguer, J. (eds) Algebra, Meaning, and Computation. Lecture Notes in Computer Science, vol 4060. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780274_18

Download citation

  • DOI: https://doi.org/10.1007/11780274_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35462-8

  • Online ISBN: 978-3-540-35464-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation