ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of the ACM (JACM)
Property preserving abstractions for the verification of concurrent systems
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Communication and Concurrency
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
MÉTÉOR: An Industrial Success in Formal Development
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
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
Test Case Preparation Using a Prototype
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
Modular Verification of Dynamic Properties for Reactive Systems
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
Property Preserving Homomorphisms of Transition Systems
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
System Specification and Refinement in Temporal Logic
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Reformulate Dynamic Properties during B Refinement and Forget Variants and Loop Invariants
ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
Synchronized Parallel Composition of Event Systems in B
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Reformulation: A Way to Combine Dynamic Properties and B Refinement
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Modular Verification for a Class of PLTL Properties
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
The Composition of Event-B Models
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Syntactic abstraction of B models to generate tests
TAP'10 Proceedings of the 4th international conference on Tests and proofs
Incremental verification of component-based timed systems
International Journal of Computer Applications in Technology
Heuristics to verify LTL properties of hierarchical systems
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
B model slicing and predicate abstraction to generate tests
Software Quality Control
| Hi-index | 0.00 |
The B method has been successfully used to specify many industrial applications by refinement. Previously, we proposed enriching the B event systems by formulating its dynamic properties in LTL. This enables us to combine model-checking with theorem-proving verification technologies. The model-checking of LTL formulae necessitates that the B event system semantics is a transition system. In this paper, we express the refinement relation by a relationship between transition systems. A result of our study shows that this relation is a special kind of simulation allowing us to exploit the partition of the reachable state space for a modular verification of LTL formulae. The results of the paper allow us to build a bridge between the above view of the refinement and the notions of observability characterized as simulation relations by Milner, van Glabbeek, Bloom and others. The refinement relation we define in the paper is a ready-simulation generalization which is similar to the refusal simulation of Ulidowsky. The way the relation is defined allows us to obtain a compositionality result w.r.t. parallel composition operation. For complex systems, it is important in practice to associate a design by refinement with a design by a parallel composition of their components. This refinement relation has two main applications: - it allows the splitting of the refined transition system into modules; - it allows the construction of complex systems by a parallel composition of components. It makes sense to qualify the refinement relation as being modular.