Skip to main content
SpringerLink
Log in

Proving behavioural theorems with standard first-order logic

  • Conference paper
  • First Online:
Algebraic and Logic Programming (ALP 1994)

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

Included in the following conference series:

Abstract

Behavioural logic is a generalization of first-order logic where the equality predicate is interpreted by a behavioural equality of objects (and not by their identity). We establish simple and general sufficient conditions under which the behavioural validity of some first-order formula with respect to a given first-order specification is equivalent to the standard validity of the same formula in a suitably enriched specification. As a consequence any proof system for first-order logic can be used to prove the behavioural validity of first-order formulas.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Bauer and R. Hennicker. Proving the correctness of algebraic implementations by the ISAR system. In Proc. of DISCO'93, pages 2–16. Springer-Verlag L.N.C.S. 722, 1993.

    Google Scholar 

  2. G. Bernot and M. Bidoit. Proving the correctness of algebraically specified software: modularity and observability issues. In Proc. of AMAST'91, pages 216–242. Springer-Verlag Workshops in Computing Series, 1992.

    Google Scholar 

  3. G. Bernot, M. Bidoit, and T. Knapik. Towards an adequate notion of observation. In Proc. of ESOP'92, pages 39–55. Springer-Verlag L.N.C.S. 582, 1992.

    Google Scholar 

  4. M. Bidoit and R. Hennicker. How to prove observational theorems with LP. In Proc. of the First International Workshop on Larch. Springer-Verlag Workshops in Computing Series, 1993.

    Google Scholar 

  5. M. Bidoit, R. Hennicker, and M. Wirsing. Characterizing behavioural semantics and abstractor semantics. In Proc. of ESOP'94, pages 105–119. Springer-Verlag L.N.C.S. 788, 1994.

    Google Scholar 

  6. H. Ehrig and B. Mahr. Fundamentals of algebraic specification 1. Equations and initial semantics, volume 6 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1985.

    Google Scholar 

  7. S. Garland and J. Guttag. An overview of LP, the Larch Prover. In Proc. of the Third International Conference on Rewriting Techniques and Applications, pages 137–151. Springer-Verlag L.N.C.S. 355, 1989.

    Google Scholar 

  8. J. Goguen and J. Meseguer. Universal realization, persistent interconnection and implementation of abstract modules. In Proc. of 9th ICALP, pages 265–281. Springer-Verlag L.N.C.S. 140, 1982.

    Google Scholar 

  9. J.A. Goguen, J.W. Thatcher, and E.G. Wagner. An initial approach to the specification, correctness, and implementation of abstract data types, volume 4 of Current Trends in Programming Methodology. Prentice Hall, 1978.

    Google Scholar 

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

    Google Scholar 

  11. R. Milner. Fully abstract models of typed λ-calculi. Theoretical Computer Science, 4:1–22, 1977.

    Google Scholar 

  12. P. Nivela and F. Orejas. Initial behaviour semantics for algebraic specification. In Recent Trends in Data Type Specification, pages 184–207. Springer-Verlag L.N.C.S. 332, 1988.

    Google Scholar 

  13. F. Orejas, M. Navarro, and A. Sànches. Implementation and behavioural equivalence: A survey. In Recent Trends in Data Type Specification, pages 93–125. Springer-Verlag L.N.C.S. 655, 1993.

    Google Scholar 

  14. H. Reichel. Initial restrictions of behaviour. In Proc. of IFIP Working Conference, The Role of Abstract Models in Information Processing, 1985.

    Google Scholar 

  15. D. Sannella and A. Tarlecki. On observational equivalence and algebraic specification. In Proc. of TAPSOFT'85, pages 308–322. Springer-Verlag L.N.C.S. 185, 1985.

    Google Scholar 

  16. O. Schoett. Behavioural correctness of data representation. Science of Computer Programming, 14:43–57, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIENS, C.N.R.S. U.R.A. 1327 & Ecole Normale Supérieure, 45, Rue d'Ulm, F-75230, Paris Cedex 05, France

    Michel Bidoit

  2. Institut für Informatik, Ludwig-Maximilians-Universität München, Leopoldstr. 11B, D-80802, 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

Giorgio Levi Mario Rodríguez-Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag

About this paper

Cite this paper

Bidoit, M., Hennicker, R. (1994). Proving behavioural theorems with standard first-order logic. In: Levi, G., Rodríguez-Artalejo, M. (eds) Algebraic and Logic Programming. ALP 1994. Lecture Notes in Computer Science, vol 850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58431-5_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-58431-5_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58431-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation