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.
In sabbatical year at Laboratoire Logiciels, Systèmes, Réseaux, Grenoble, France.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.-R. Abrial. The B-Book, Assigning Programs to Meanings. Cambridge University Press, 1996.
J.-R. Abrial. Extending B Without Changing it (for Developing Distributed Systems). In First B Conference, pages 169–190. Nantes, november 1996.
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.
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.
R. J. R. Back and Q. W. Xu. Fairness in action systems. Reports on Computer Science & Mathematics 159, Åbo Akademi, 1995.
M. Butler and M. Waldén. Distributed System Development in B. In First B Conference, pages 155–168. Nantes, november 1996.
K. Mani Chandy and Jayadev Misra. Parallel Program Design A Foundation. Addison-Wesley, 1988.
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.
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.
D. Méry. Machines Abstraites Temporelles Analyse Comparative de B et TLA+. In First B Conference, pages 191–220. Nantes, november 1996.
Josyula Ramachandra Rao. Extensions of the UNITY Methodology. Number 908 in Lectures Notes in Computer Science. Springer, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barradas, H.R., Bert, D. (2002). Specification and Proof of Liveness Properties under Fairness Assumptions in B Event Systems. In: Butler, M., Petre, L., Sere, K. (eds) Integrated Formal Methods. IFM 2002. Lecture Notes in Computer Science, vol 2335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47884-1_20
Download citation
DOI: https://doi.org/10.1007/3-540-47884-1_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43703-1
Online ISBN: 978-3-540-47884-3
eBook Packages: Springer Book Archive