Proving event ordering properties for information systems

Authors:
Marc Frappier;Régine Laleau
Affiliations:
Département de mathématiques et d’informatique, Université de Sherbrooke, Sherbrooke, Québec, Canada;Laboratoire CEDRIC, Institut d’Informatique d’Entreprise Conservatoire National des Arts et Métiers, Évry Cedex France
Venue:
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Year:
2003

Citing 8
Cited 3

Communicating sequential processes

Communicating sequential processes
Introduction to the ISO specification language LOTOS

Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
CSP-OZ: a combination of object-Z and CSP

FMOODS '97 Proceedings of the IFIP TC6 WG6.1 international workshop on Formal methods for open object-based distributed systems
Specification, Refinement and Verification of Concurrent Systems—An Integration of Object-Z and CSP

Formal Methods in System Design
Communication and Concurrency

Communication and Concurrency
Introducing Dynamic Constraints in B

B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
Translating Statecharts to B

IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
An Overview of a Method and its Support Tool for Generating B Specifications from UML Notations

ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering

Efficient symbolic execution of large quantifications in a process algebra

ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Refinement of EB3 process patterns into B specifications

B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
Synthesizing b specifications from EB3 attribute definitions

IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an approach to prove event ordering properties for B specifications of information systems. The properties are expressed using the EB3 notation, where input event ordering properties are defined using a process algebra similar to CSP and output events are specified by recursive functions on the input traces associated to the process expression. By proving that the EB3 specification is refined by the B specification, using the B theory of refinement, we ensure that both specifications accept and refuse exactly the same event traces. The proof relies on an extended labeled transition system, generated using the operational semantics of the process algebra, in order to deal with unbounded systems. The gluing invariant is generated from the EB3 recursive functions.