ACM Transactions on Programming Languages and Systems (TOPLAS)
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
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
Refinement Calculus, Part II: Parallel and Reactive Programs
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Engineering and theoretical underpinnings of retrenchment
Science of Computer Programming
Refinement: A Constructive Approach to Formal Software Design for a Secure e-voting Interface
Electronic Notes in Theoretical Computer Science (ENTCS)
Generic Tools via General Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Refinement, Decomposition, and Instantiation of Discrete Models: Application to Event-B
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
More Relational Concurrent Refinement: Traces and Partial Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
General Refinement, Part One: Interfaces, Determinism and Special Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Relational Concurrent Refinement: Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving Quicksort Correct in Event-B
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving linearizability via non-atomic refinement
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Qualitative probabilistic modelling in event-B
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Formal behavior modeling and effective automatic refinement
Information Sciences: an International Journal
Compositional action system derivation using enforced properties
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Development of a synchronous subset of AADL
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Refinement-animation for event-b: towards a method of validation
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Verification of LTL on b event systems
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
Modelling and proof analysis of interrupt driven scheduling
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
Refinement of statemachines using event b semantics
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
Formal transformation of platform independent models into platform specific models
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
Development of fault tolerant grid applications using distributed b
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
Refinement-Based modeling of 3d nocs
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Refinement, Decomposition, and Instantiation of Discrete Models: Application to Event-B
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Proved-patterns-based development for structured programs
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Validation of formal models by refinement animation
Science of Computer Programming
| Hi-index | 0.00 |
Since the early 90's (after the seminal article of R. Back [4]), the refinement of stuttering steps [5] are performed by means of new actions (called here events) refining skip. It is shown in this article that such a refinement method is not always possible in the development of large systems. We shall instead use events refining some kind of non-deterministic actions maintaining the invariant (sometimes called keep). We show that such new refinements are completely safe. In a second part, we explain how such a mechanism can be used to express some reachability conditions that were otherwise expressed using some special temporal logic statements à la TLA [5] in a previous article [2]. Examples will be used to illustrate our proposals.