Constraint satisfaction algorithms
Computational Intelligence
Software development: two approaches to animation of Z specifications using Prolog
Software Engineering Journal
Type inclusion constraints and type inference
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
The dynamic domain reduction procedure for test data generation
Software—Practice & Experience
A Computation Model for Z Based on Concurrent Constraint Resolution
ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
A Comparison of the BTT and TTF Test-Generation Methods
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
A CLP Framework for Computing Structural Test Data
CL '00 Proceedings of the First International Conference on Computational Logic
Set Constraints and Logic Programming
CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics
Test Sequences Generation from LUSTRE Descriptions: GATEL
ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
Proceedings of the 16th IEEE international conference on Automated software engineering
Automated Boundary Testing from Z and B
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Integrating finite domain constraints and CLP with sets
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Test Case Generation by OCL Mutation and Constraint Solving
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
Generation of test sequences from formal specifications: GSM 11-11 standard case study
Software—Practice & Experience
Declarative programming for verification: lessons and outlook
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Automated Property Verification for Large Scale B Models
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Integrating Finite Domain and Set Constraints into a Set-based Constraint Language
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Validating Z specifications using the PROB animator and model checker
IFM'07 Proceedings of the 6th international conference on Integrated 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
Automated boundary test generation from JML specifications
FM'06 Proceedings of the 14th international conference on Formal Methods
Integrating Finite Domain and Set Constraints into a Set-based Constraint Language
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
| Hi-index | 0.00 |
This paper proposes an approach to the evaluation of B formal specifications using Constraint Logic Programming with sets. This approach is used to animate and generate test sequences from B formal specifications. The solver, called CLPS-B, is described in terms of constraint domains, consistency verification and constraint propagation. It is more powerful than most constraint systems, because it allows the domain of variable to contain other variables, which increase the level of abstraction. The constrained state propagates the non-determinism of the B specifications and reduces the number of states in a reachability graph. We illustrate this approach by comparing the constrained states graph exploration with the concrete one in a simple example: Process scheduler.