Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic for Programming Artificial Intelligence and Reasoning

LPAR 2000: Logic for Programming and Automated Reasoning pp 54–69Cite as

Behavioural Constructor Implementation for Regular Algebras

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Artificial Intelligence ((LNAI,volume 1955))

Abstract

We investigate regular algebras, admitting infinitary regular terms interpreted as least upper bounds of suitable approximation chains. The main result of this paper is an adaptation of the concept of behavioural constructor implementation, studied widely e.g. for standard algebras, to the setting of regular algebras. We formulate moreover a condition that makes proof of correctness of an implementation step tractable. In particular, we indicate when it is sufficient to consider only finitary observational contexts in the proofs of behavioural properties of regular algebras.

The work reported here was partially supported by the KBN grant 8 T11C 019 19.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Bidoit, M., Hennicker, R. Modular correctness proofs of behavioural implementations. Acta Informatica 35(11):951–1005, 1998. 55, 58, 60

    Article  MathSciNet  Google Scholar 

  3. Bidoit, M., Hennicker, R., Wirsing, M. Behavioural and abstractor specifications. Science of Computer Programming 25(2–3), 1995. 58, 59

    Google Scholar 

  4. Bidoit, M., Tarlecki, A. Regular algebras: a framework for observational specifications with recursive definitions. Report LIENS-95-12, Ecole Normale Superieure, 1995. 54, 56, 57, 57, 57, 58

    Google Scholar 

  5. Bidoit, M., Tarlecki A. Behavioural satisfaction and equivalence in concrete model categories. Manuscript. A short version appeared in Proc. 20th Coll. on Trees in Algebra and Computing CAAP’96, Linköping, LNCS 1059, 241–256, Springer-Verlag, 1996. 54, 56, 59

    Google Scholar 

  6. Guessarian, I., Parisi-Presicce, F. Iterative vs. regular factor algebras. SIGACT News 15(2), 32–44, 1983. 54

    Article  Google Scholar 

  7. Hennicker, R. Context induction: A proof principle for behavioural abstractions and algebraic implementations. Formal Aspects of Computing, 3(4):326–345, 1991. 55, 60

    Article  MATH  Google Scholar 

  8. Knapik, T. Specifications algebriques observationnelles modulaires: une semantique fondee sur une relation de satisfaction observationnelle. PhD Thesis, Ecole Normal Superieur, Paris, 1993. 57

    Google Scholar 

  9. Lasota, S. Algebraic observational equivalence and open-maps bisimilarity. PhD Thesis, Institute of Informatics, Warsaw University, March 2000. Accessible at http://www.mimuw.edu.pl/~sl/work/phd.ps.gz. 55, 56, 59, 61, 69

  10. Lasota, S. Finitary observations in regular algebras. To appear in Proc. 27th Seminar on Current Trends in Theory and Practice of Informatics SOFSEM’2000, LNCS. Accessible at http://www.mimuw.edu.pl/~sl/papers. 60,61,61

    Google Scholar 

  11. Rutten, J. J. M. M. Universal coalgebra: a theory of systems. CWI Report CS-R9652, 1996. 67

    Google Scholar 

  12. Sannella, D., Tarlecki, A. Towards formal development of programs from algebraic specifications: implementations revisited. Acta Informatica 25:233–281, 1988. 54, 55, 58, 59

    Article  MATH  MathSciNet  Google Scholar 

  13. Sannella, D., Tarlecki, A. Essential Concepts of Algebraic Specification and Program Development. Formal Aspects of Computing 9:229–269, 1997. 54, 55, 58, 59

    Article  MATH  Google Scholar 

  14. Schoett, O. Data abstraction and correctness of modular programming. PhD thesis, CST-42-87, Department of Computer Science, University of Edinburgh, 1987. 55, 61

    Google Scholar 

  15. Tarlecki, A., Wirsing, M. Continuous abstract data types. Fundamenta Informaticae 9(1986), 95–126. 54

    MATH  MathSciNet  Google Scholar 

  16. Tiuryn, J. Fixed-points and algebras with infinitely long expressions. Part I. Regular algebras. Fundamenta Informaticae 2(1978), 102–128. 54

    Google Scholar 

  17. Tiuryn, J. Fixed-points and algebras with infinitely long expressions. Part II. Muclones of regular algebras. Fundamenta Informaticae 2(1979), 317–336. 54

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, Banacha 2, 02-097, Warszawa, Poland

    Sławomir Lasota

Authors
  1. Sławomir Lasota
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS, Université de Paris 7, case 7012, 2 place Jussieu, 75251, Paris Cedex 05, France

    Michel Parigot

  2. Computer Science Department, University of Manchester, Oxford Rd, M13 9PL, Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lasota, S. (2000). Behavioural Constructor Implementation for Regular Algebras. In: Parigot, M., Voronkov, A. (eds) Logic for Programming and Automated Reasoning. LPAR 2000. Lecture Notes in Artificial Intelligence(), vol 1955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44404-1_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-44404-1_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41285-4

  • Online ISBN: 978-3-540-44404-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation