Skip to main content
SpringerLink
Log in

Well defined B

  • Conference paper
  • First Online:
B’98: Recent Advances in the Development and Use of the B Method (B 1998)

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

Included in the following conference series:

Abstract

B is a language with a three-valued semantics: terms like min(0) or 1/0 are ill-defined, consequently formulas containing ill-defined terms may also be ill-defined. Therefore the deduction system we use to discharge the proof obligations should be constructed from a three-valued logic. In this paper, we introduce a deduction system that allows to reason in a two-valued logic if new proof obligations called well-definedness lemmas are also proved. We define this deduction s ystem and the new proof obligations that ensure the well-definedness of B components. The practical benefits on the proof mechanisms are then outlined.

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. Abrial J.R., The B Book (1996)

    Google Scholar 

  2. Barringer H., Cheng J.H., Jones C.B., A Logic Covering Undefinedness in Program Proofs; Acta Informatica 21:251–269 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  3. Blikle A., Konikowska B., Tarlecki A., A Three Valued Logic for Software Specification and Validation; LNCS 328 (1988)

    Google Scholar 

  4. Cheng J.H., Jones C.B., On the Usability of Logics Which Handle Partial Functions; Proceedings of the Third Refinement Workshop 51–69 (1990)

    Google Scholar 

  5. Elvang-GØransson M., Owe O., A Simple Sequent Calculus for Partial Functions; TCS 114:317–330 (1993)

    Article  MATH  Google Scholar 

  6. Gavilanes-Franco A., Lucio-Carrasco F. A First Order Logic for Partial Functions; TCS 74 37–69 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  7. Holden M., Weak Logic Theory; TCS 79:295–321 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  8. Owe O., Partial Logics Reconsidered: a Conservative Approach, Research Report 155, Department of Informatics, University of Oslo, 1991; Formal Aspects of Comput. 5:208–223 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Matra Transport International, 48-56 rue Barbès, 92120, Montrouge

    Patrick Behm, Lilian Burdy & Jean -Marc Meynadier

  2. Conservatoire National des Arts et Métiers, Laboratoire CEDRIC, 292 rue St Martin, 75141, Paris Cedex 3

    Lilian Burdy

Authors
  1. Patrick Behm
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lilian Burdy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jean -Marc Meynadier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Didier Bert

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Behm, P., Burdy, L., Meynadier, J.M. (1998). Well defined B. In: Bert, D. (eds) B’98: Recent Advances in the Development and Use of the B Method. B 1998. Lecture Notes in Computer Science, vol 1393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053354

Download citation

  • DOI: https://doi.org/10.1007/BFb0053354

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64405-7

  • Online ISBN: 978-3-540-69769-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation