Advertisement

Specification and Proof of Liveness Properties under Fairness Assumptions in B Event Systems

  • Héctor Ruíz Barradas
  • Didier Bert
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2335)

Abstract

We present a proposal of specification and proof of liveness properties in B event systems under fairness assumptions. We give proof obligations in order to prove basic progress properties in B event systems under two types of assumptions: minimal progress and weak fairness. We define proof obligations in terms of weakest preconditions, which allow us to prove basic liveness properties as usual B proof obligations. We suggest the use of unity “Leads To” operator to specify more general liveness properties. In this way, we integrate the unity logic in the specification and proof of B event systems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J.-R. Abrial. The B-Book, Assigning Programs to Meanings. Cambridge University Press, 1996.Google Scholar
  2. 2.
    J.-R. Abrial. Extending B Without Changing it (for Developing Distributed Systems). In First B Conference, pages 169–190. Nantes, november 1996.Google Scholar
  3. 3.
    J.-R. Abrial and L. Mussat. Introducing Dynamic Constraints in B. In B’98: Recent Advances in the Development and Use of the B Method, LNCS 1393, pages 83–128. Springer-Verlag, april 1998.CrossRefGoogle Scholar
  4. 4.
    Krzysztof R. Apt and Ernst-Rüdiger Olderog. Verification of Sequential and Concurrent Programs. Graduate texts in computer science. Springer-Verlag, second edition edition, 1997.Google Scholar
  5. 5.
    R. J. R. Back and Q. W. Xu. Fairness in action systems. Reports on Computer Science & Mathematics 159, Åbo Akademi, 1995.Google Scholar
  6. 6.
    M. Butler and M. Waldén. Distributed System Development in B. In First B Conference, pages 155–168. Nantes, november 1996.Google Scholar
  7. 7.
    K. Mani Chandy and Jayadev Misra. Parallel Program Design A Foundation. Addison-Wesley, 1988.Google Scholar
  8. 8.
    S. Chouali F. Bellegarde and J. Julliand. Verification of Dynamic Constraints for B Event Systems under Fairness Assumptions. In ZB 2002 International Conference, LNCS 2272, pages 481–500. Springer-Verlag, january 2002.Google Scholar
  9. 9.
    P.-A. Masson J. Julliand and H. Mountassir. Vérification par model-checking modulaire des propriétés dynamiques introduites en B. Technique et science informatique, 20(7), 2001.Google Scholar
  10. 10.
    D. Méry. Machines Abstraites Temporelles Analyse Comparative de B et TLA+. In First B Conference, pages 191–220. Nantes, november 1996.Google Scholar
  11. 11.
    Josyula Ramachandra Rao. Extensions of the UNITY Methodology. Number 908 in Lectures Notes in Computer Science. Springer, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Héctor Ruíz Barradas
    • 1
  • Didier Bert
    • 2
  1. 1.Universidad Autónoma Metropolitana AzcapotzalcoMéxico D.F.México
  2. 2.Laboratoire Logiciels, SystèmesRéseaux - LSR-IMAGGrenobleFrance

Personalised recommendations