References

  1. Jean-Raymond Abrial, Michael Butler, Stefan Hallerstede, Thai Son Hoang, Farhad Mehta & Laurent Voisin (2010): Rodin: an open toolset for modelling and reasoning in Event-B. International Journal on Software Tools for Technology Transfer 12(6), pp. 447–466, doi:10.1007/s10009-010-0145-y.
  2. Krzysztof R. Apt & Peter Zoeteweij (2007): An Analysis of Arithmetic Constraints on Integer Intervals. Constraints 12(4), pp. 429–468, doi:10.1007/s10601-007-9017-9.
  3. Clark Barrett, Roberto Sebastiani, Sanjit Seshia & Cesare Tinelli (2009): Satisfiability Modulo Theories. In: Handbook of Satisfiability, chapter 26. IOS Press, pp. 825–885, doi:10.3233/978-1-58603-929-5-825.
  4. John Black & Phillip Rogaway (2002): Ciphers with Arbitrary Finite Domains. In: Topics in Cryptology — CT-RSA 2002, LNCS 2271. Springer, pp. 114–130, doi:10.1007/3-540-45760-7_9.
  5. Mats Carlsson & Thom Fruehwirth (2014): Sicstus PROLOG User's Manual 4.3. Books On Demand - Proquest.
  6. Mats Carlsson, Greger Ottosson & Björn Carlson (1997): An open-ended finite domain constraint solver. In: Programming Languages: Implementations, Logics, and Programs, LNCS 1292. Springer, pp. 191–206, doi:10.1007/BFb0033845.
  7. Jan Christiansen & Sebastian Fischer (2008): EasyCheck — Test Data for Free. In: Jacques Garrigue & Manuel V. Hermenegildo: Functional and Logic Programming: 9th International Symposium, FLOPS 2008, Ise, Japan, April 14-16, 2008. Proceedings. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 322–336, doi:10.1007/978-3-540-78969-7_23.
  8. ClearSy (2016): Atelier B, User and Reference Manuals, Aix-en-Provence, France. Available at http://www.atelierb.eu/.
  9. Leonardo De Moura & Nikolaj Bjørner (2008): Z3: An Efficient SMT Solver. In: Proceedings TACAS, LNCS 4963. Springer, pp. 337–340, doi:10.1007/978-3-540-78800-3_24.
  10. Jerome Falampin, Hung Le-Dang, Michael Leuschel, Mikael Mokrani & Daniel Plagge (2013): Improving Railway Data Validation with ProB. In: Industrial Deployment of System Engineering Methods. Springer, pp. 27–44, doi:10.1007/978-3-642-33170-1_4.
  11. Ronald Aylmer Fisher & Frank Yates (1953): Statistical tables for biological, agricultural and medical research, 3 edition. Oliver and Boyd.
  12. Thom Frühwirth (1998): Theory and practice of Constraint Handling Rules. The Journal of Logic Programming 37(1–3), pp. 95 – 138, doi:10.1016/S0743-1066(98)10005-5.
  13. Thom Frühwirth (2009): Constraint Handling Rules. Cambridge University Press, doi:10.1017/CBO9780511609886.
  14. Carla P. Gomes, Bart Selman & Henry Kautz (1998): Boosting Combinatorial Search Through Randomization. In: Proceedings AAAI, AAAI/IAAI. American Association for Artificial Intelligence, pp. 431–437.
  15. Dominik Hansen, David Schneider & Michael Leuschel (2016): Using B and ProB for Data Validation Projects. In: Proceedings ABZ, LNCS 9675. Springer, doi:10.1007/978-3-319-33600-8_10.
  16. Daniel Jackson (2006): Software Abstractions: Logic, Language and Analysis. MIT Press.
  17. Joxan Jaffar & Spiro Michaylov (1987): Methodology and Implementation of a CLP System. In: Proceedings ICLP, pp. 196–218.
  18. Donald E. Knuth (1997): The Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3 edition. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, doi:10.1137/1012065.
  19. Sebastian Krings, Jens Bendisposto & Michael Leuschel (2015): From Failure to Proof: The ProB Disprover for B and Event-B. In: Proceedings SEFM, LNCS 9276. Springer, doi:10.1007/978-3-319-22969-0_15.
  20. Sebastian Krings & Michael Leuschel (2016): SMT Solvers for Validation of B and Event-B models. In: Proceedings iFM, LNCS 9681. Springer, doi:10.1007/978-3-319-33693-0_23.
  21. Michael Leuschel, Jens Bendisposto, Ivaylo Dobrikov, Sebastian Krings & Daniel Plagge (2014): From Animation to Data Validation: The ProB Constraint Solver 10 Years On. In: Jean-Louis Boulanger: Formal Methods Applied to Complex Systems: Implementation of the B Method, chapter 14. Wiley ISTE, Hoboken, NJ, pp. 427–446, doi:10.1002/9781119002727.ch14.
  22. Michael Leuschel & Michael Butler (2003): ProB: A Model Checker for B. In: Proceedings FME, LNCS 2805. Springer, pp. 855–874, doi:10.1007/978-3-540-45236-2_46.
  23. Michael Leuschel & Michael Butler (2008): ProB: An Automated Analysis Toolset for the B Method. Software Tools for Technology Transfer (STTT) 10(2), pp. 185–203, doi:10.1007/s10009-007-0063-9.
  24. Olivier Ligot, Jens Bendisposto & Michael Leuschel (2007): Debugging Event-B Models using the ProB Disprover Plug-in. Proceedings AFADL.
  25. M. Luby & C. Rackoff (1988): How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM Journal on Computing 17(2), pp. 373–386, doi:10.1137/0217022.
  26. Alfred J. Menezes, Scott A. Vanstone & Paul C. Van Oorschot (1996): Handbook of Applied Cryptography, 1st edition. CRC Press, Inc., Boca Raton, FL, USA, doi:10.1201/9781439821916.
  27. Daniel Plagge & Michael Leuschel (2012): Validating B, Z and TLA+ using ProB and Kodkod. In: Proceedings FM, LNCS 7436. Springer, pp. 372–386, doi:10.1007/978-3-642-32759-9_31.
  28. David Schneider, Michael Leuschel & Tobias Witt (2015): Model-Based Problem Solving for University Timetable Validation and Improvement. In: Proceedings FM, LNCS 9109. Springer, pp. 487–495, doi:10.1007/978-3-319-19249-9_30.
  29. Markus Triska (2014): Correctness Considerations in CLP(FD) Systems. Vienna University of Technology.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org