1. Abrial JR, Butler M, Hallerstede S, Hoang TS, Mehta F, Voisin L (2010) Rodin: an open toolset for modelling and reasoning in event-b. Int J Softw Tools Technol Transf 12: 447–466
2. Back RJ (1978) On the correctness of refinement steps in program development. Ph.D. thesis, University of Helsinki, Finland. Report A–1978–4
3. Back RJ, Fan X, Preoteasa V (2003) Reasoning about pointers in refinement calculus. Tech. Rep. 543, TUCS-Turku Centre for Computer Science, Turku, Finland
4. Berger U, Schwichtenberg H (1994) Program extraction from classical proofs. In: Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, International Workshop LCC ’94, Indianapolis, Indiana, USA, 13–16 October 1994. Lecture Notes in Computer Science, vol 960. Springer, Berlin, pp 77–97
5. Bonichon R, Delahaye D, Doligez D (2007) Zenon: an extensible automated theorem prover producing checkable proofs. In: Dershowitz N, Voronkov A (eds) LPAR. Lecture notes in computer science, vol 4790. Berlin, Springer, pp 151–165