Communicating sequential processes
Communicating sequential processes
Proc. of the European symposium on programming on ESOP 86
XSB as an efficient deductive database engine
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Model checking
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming
Proceedings of the 17th International Conference on Logic Programming
Infinite State Model Checking by Abstract Interpretation and Program Specialisation
LOPSTR'99 Selected papers from the 9th International Workshop on Logic Programming Synthesis and Transformation
An Approach to the Design of Distributed Systems with B AMN
ZUM '97 Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation
Checking Z Data Refinements Using an Animation Tool
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
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
Model checking object petri nets in prolog
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Combining CSP and b for specification and property verification
FM'05 Proceedings of the 2005 international conference on Formal Methods
Visualising larger state spaces in ProB
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Simulation Machines for Checking Action System Refinements
Electronic Notes in Theoretical Computer Science (ENTCS)
Using Model Checking to Automatically Find Retrieve Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
The High Road to Formal Validation
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
A Practical Single Refinement Method for B
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Z2SAL - Building a Model Checker for Z
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Probing the Depths of CSP-M: A New fdr-Compliant Validation Tool
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
TFM '09 Proceedings of the 2nd International Conference on Teaching Formal Methods
Validating Z specifications using the PROB animator and model checker
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Efficient approximate verification of B and Z models via symmetry markers
Annals of Mathematics and Artificial Intelligence
Issues in implementing a model checker for z
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
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
Validating and animating higher-order recursive functions in b
Rigorous Methods for Software Construction and Analysis
Synthesis of scenario based test cases from b models
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
Symmetry reduction for b by permutation flooding
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
Validation of formal models by refinement animation
Science of Computer Programming
| Hi-index | 0.00 |
Refinement is a key concept in the B-Method. While refinement is at the heart of the B Method, so far no automatic refinement checker has been developed for it. In this paper we present a refinement checking algorithm and implementation for B. It is based on using an operational semantics of B, obtained in practice by the ProB animator. The refinement checker has been integrated into ProB toolset and we present various case studies and empirical results in the paper, showing the algorithm to be surprisingly effective. The algorithm checks that a refinement preserves the trace properties of a specification. We also compare our tool against the refinement checker FDR for CSP and discuss an extension for singleton failure refinement.