Skip to main content

State-Based Extension of CASL

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1945))

Abstract

A state-based extension of the algebraic specification langu- age CASL is presented. It permits the specification of the static part of a complex dynamic system by means of CASL and the dynamic part by means of the facilities described in the paper. The dynamic system is defined as possessing a number of states and a number of operations (procedures) for transforming one state into another. Each state possesses one and the same static part specified by CASL and a varying part specified by additional tools. The varying part includes dynamic sorts/functions/predicates and dependent functions/predicates. The dependent functions/predicates are specified by formulae using the names of the dynamic functions/predicates so that each time one of the last ones is updated the corresponding former ones are also updated. The updates of the dynamic entities are produced by procedures which are specified by means of preconditions, postconditions, and dynamic equations.

This research has been partially supported by ESPRIT working group 29432 (CoFI WG) and the Russian Foundation for Basic Research under Grant 98-01-00682

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Astesiano and E. Zucca. A semantic model for dynamic systems. In Modeling Database Dynamics, Workshops in Computing, pages 63–83, Volkse 1992, 1993. Springer.

    Google Scholar 

  2. E. Astesiano and E. Zucca. D-oids: a model for dynamic data types. Mathematical Structures in Computer Science, 5(2):257–282, June 1995.

    Article  MATH  MathSciNet  Google Scholar 

  3. H. Baumeister. Relations as abstract datatypes: An institution to specify relationsbetween algebras. In TAPSOFT 95, volume 915of LNCS, pages 756–771. Springer, 1995.

    Google Scholar 

  4. H. Baumeister. Using algebraic specification languages for model-oriented spe-cifications. Tech. report MPI-I-96-2-003, Max-Planck-Institut für Informatik, Saarbrücken, February 1996.

    Google Scholar 

  5. H. Baumeister. Relations between Abstract Datatypes modeled as Abstract Dataty-pes. PhD thesis, Universität des Saarlandes, Saarbrücken, November 1998.

    Google Scholar 

  6. E. Börger. Composition and structuring principles for ASMs. In Abstract State Machines ASM 2000 (Proc. Int. Workshop on Abstract State Machines, Monta Verita, Switzerland, March 2000), LNCS. Springer, 2000. to appear.

    Google Scholar 

  7. M. Cerioli, T. Mossakowski, and H. Reichel. From total equational to partial first-order logic. In E. Astesiano, H.-J. Kreowski, and B. Krieg-Brückner, editors, Algebraic Foundations of Systems Specification, pages 31–104. Springer, 1999.

    Google Scholar 

  8. P. Dauchy and M.-C. Gaudel. Algebraic specifications with implicit state. Tech. report No 887, Laboratoire de Recherche en Informatique, Univ. Paris-Sud, 1994.

    Google Scholar 

  9. M.-C. Gaudel, C. Khoury, and A. Zamulin. Dynamic systems with implicit state. In Fundamental Approaches to Software Engineering, volume 1577of LNCS, pages 114–128. Springer, 1999.

    Google Scholar 

  10. M Große-Rhode. Concurrent state transformation on abstract data types. In Recent Trends in Data Type Specifications, volume 1130of LNCS, pages 222–236. Springer, 1995.

    Google Scholar 

  11. M. Große-Rhode. Transition specifications for dynamic abstract data types. Ap-plied Categorical Structures, pages 265–308, 1997.

    Google Scholar 

  12. M. Große-Rhode. Specification of state based systems by algebra rewrite systems and refinements. Tech. report 99-04, TU Berlin, FB Informatik, March 1999.

    Google Scholar 

  13. Y. Gurevich. Evolving Algebras 1993: Lipary guide. In Specification and Validation Methods, pages 9–36. Oxford University Press, 1995.

    Google Scholar 

  14. Y. Gurevich. ASM guide 1997. EECS Departmental Technical Report CSE-TR-336-97, University of Michigan, 1997.

    Google Scholar 

  15. C. Khoury, M.-C. Gaudel, and P. Dauchy. AS-IS. Tech. report No 1119, Univ. Paris-Sud, 1997.

    Google Scholar 

  16. K. Lellahi and A. Zamulin. Dynamic systems based on update sets. Tech. report 99-03, LIPN, Univ. Paris 13 (France), 1999.

    Google Scholar 

  17. P. Mosses. CASL: a guided tour of its design. In Recent Trends in Algebraic Development Techniques: Selected Papers from WADT’98, volume 1589 of LNCS, Lisbon, 1999. Springer.

    Google Scholar 

  18. A. Zamulin. Dynamic system specification by Typed Gurevich Machines. In Proc. Int. Conf. on Systems Science, Wroclaw, Poland, September 15-18 1998.

    Google Scholar 

  19. E. Zucca. From static to dynamic data types. In Mathematical Foundations of Computer Science, volume 1113 of LNCS, pages 579–590, 1996.

    Google Scholar 

  20. E. Zucca. From static to dynamic abstract data types: an institution transforma-tion. Theorical Computer science, 216:109–157, 1999.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baumeister, H., Zamulin, A. (2000). State-Based Extension of CASL. In: Grieskamp, W., Santen, T., Stoddart, B. (eds) Integrated Formal Methods. IFM 2000. Lecture Notes in Computer Science, vol 1945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40911-4_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-40911-4_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41196-3

  • Online ISBN: 978-3-540-40911-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics