CLPS-B - A constraint solver for B

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2280 LNCS, Issue , 2002, Pages 188-204

  Bouquet, Fabrice ^a   Legeard, Bruno ^a   Peureux, Fabien ^a  

^a UNIVERSITÉ DE FRANCHE COMTÉ   (France)

Author keywords

Animation; B Method; CLP; CSP; Evaluation of specifications; Set constraints

Indexed keywords

ANIMATION; COMPUTER PROGRAMMING LANGUAGES; FORMAL SPECIFICATION; LOGIC PROGRAMMING;

B METHOD; CONSISTENCY VERIFICATIONS; CONSTRAINT LOGIC PROGRAMMING; CONSTRAINT PROPAGATION; CONSTRAINT SOLVERS; LEVEL OF ABSTRACTION; REACHABILITY GRAPHS; SET CONSTRAINTS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84888245045     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46002-0_14     Document Type: Conference Paper

References (22)

1. J-R Abrial. The B-Book. Cambridge University Press, 1996.
2. F. Ambert, B. Legeard, and E. Legros. Constraint Logic Programming on Sets and Multisets. In Proceedings of ICLP'94, pages 151-165, 1994.
3. A. Aiken and E.L. Wilmmers. Type Inclusion Constraints and Type Inference. In Conference on FPL Computer Architecture, pages 31-41, 1993.
4. B-Core(UK) Ltd, http://www.b-core.com/btoolkit.html. B-Toolkit, 10/2001.
5. F. Bouquet, B. Legeard, and F. Peureux. Constraint logic programming with sets for animation of B formal specifications. In CL'2k Workshop LPSE, 2000.
6. Clearsy, http://www.atelierb.societe.com. Atelier B V3, 10/2001.
7. J. Dick. Using Prolog to animate Z specifications. In Z User Meeting 1989. Workshops in Computing. Springer-Verlag, 1990.
8. European Telecoms Std Institute. GSM 11.11 v7. http://www.etsi.org, 1999.
9. A. Gotlieb, B. Botella, and M. Rueher. A CLP framework for computing structural test data. In Springer-Verlag, editor, CL'2000, pages 399-413, 2000.
10. C. Gervet. Interval Propagation to Reason about Sets: Definition and Implementation of a practical language. Constraints, 1(2), 1997.
11. Wolgang Grieskamp. A computation model for Z based on concurrent constraint resolution. In LNCS, editor, ZB'00, volume 1878, pages 414-432, 2000.
12. D. Kozen. Set Constraints and logic Programming (abstract). In Proceedings of the 1st International Conference Constraints in Computational Logics, LNCS 845. Springer-Verlag, 1994.
13. H. Lotzbeyer and A. Pretschner. AutoFocus on constraint logic programming. In CL'2000 Workshop LPSE, London, UK, 2000.
14. th IEEE International conference on ASE'2001, pages 377-381, 2001.
15. nd International Z and B Conference (ZB'02), page to appear, Grenoble, France, January 2002.
16. th IEEE International Conference on Automated Software Engineering (ASE'00), Grenoble, France, 2000.
17. C. Meudec. ATGEN: Automatic test data generation using constraint logic programming and symbolic execution. The Journal of Software Testing, Verification and Reliability, 11(2):81-96, 2001.
18. B. A. Nadel. Constraint Satisfaction Algorithms. Computer Intelligence, 5:188-224, 1989.
19. A.J. Offutt, Z. Jin, and J. Pan. The dynamic domain reduction procedure for test data generation. The Journal of SPE, 29(2):167-193, 1999.
20. L. Sterling, P. Ciancarini, and T. Turnidge. On the animation of "not executable" specification by prolog. in Journal of Software Engineering and Knowledge Engineering, 6(1):63-87, 1996.
21. E. Tsang. Foundation of constraint satisfaction. Academic Press, 1993.
22. M.M. West and B.M. Eaglestone. Software Development: Two approaches to animation of Z specifications using Prolog. Software Engineering Journal, 7(4):264-276, 1992.