A. Abrial, Modeling in Event-B: System and Software Design, 2010.
DOI : 10.1017/CBO9781139195881

D. Bert and F. Cave, Construction of Finite Labelled Transition Systems from B Abstract Systems, In IFM, pp.235-254, 2000.
DOI : 10.1007/3-540-40911-4_14

J. Bjm16-]-hadrien-bride, P. Julliand, and . Masson, Tri-modal under-approximation for test generation, Science of Computer Programming, vol.132, issue.P2, pp.190-208, 2016.
DOI : 10.1016/j.scico.2016.07.003

N. E. Beckman, A. V. Nori, S. K. Rajamani, R. J. Simmons, S. Tetali et al., Proofs from Tests, IEEE Transactions on Software Engineering, vol.36, issue.4, pp.495-508, 2010.
DOI : 10.1109/TSE.2010.49

P. Cousot and R. Cousot, Abstract Interpretation Frameworks, Journal of Logic and Computation, vol.2, issue.4, pp.511-547, 1992.
DOI : 10.1093/logcom/2.4.511

V. Cgp-+-06-]-cristian-cadar, P. M. Ganesh, D. L. Pawlowski, D. R. Dill, and . Engler, EXE: automatically generating inputs of death, ACM CCS, pp.322-335, 2006.

]. E. Dij75 and . Dijkstra, Guarded commands, nondeterminacy, and formal derivation of programs, Com. of the ACM, vol.18, issue.8, pp.453-457, 1975.

]. E. Dij76 and . Dijkstra, A Discipline of Programming, 1976.

L. De-moura and N. Bjorner, Z3: An Efficient SMT Solver, TACAS, pp.337-340, 2008.
DOI : 10.1007/978-3-540-78800-3_24

W. Grieskamp, Y. Gurevich, W. Schulte, and M. Veanes, Generating finite state machines from abstract state machines, ISSTA, pp.112-122, 2002.
DOI : 10.1145/566172.566190
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.2927

P. Godefroid, M. Huth, and R. Jagadeesan, Abstraction-Based Model Checking Using Modal Transition Systems, In CONCUR, pp.426-440, 2001.
DOI : 10.1007/3-540-44685-0_29
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.1604

S. Bhargav, T. A. Gulavani, Y. Henzinger, A. V. Kannan, S. K. Nori et al., Synergy: a new algorithm for property checking, SIGSOFT FSE, pp.117-127, 2006.

R. [. Godefroid and . Jagadeesan, On the Expressiveness of 3-Valued Models, VMCAI, volume 2575 of LNCS, pp.206-222, 2003.
DOI : 10.1007/3-540-36384-X_18

Y. Gurevich, P. W. Kutter, M. Odersky, and L. Thiele, Abstract State Machines, Theory and Applications LNCS, 1912.

P. Godefroid, N. Klarlund, and K. Sen, DART: directed automated random testing, PLDI, pp.213-223, 2005.

H. [. Graf and . Saidi, Construction of abstract state graphs with PVS, CAV, pp.72-83, 1997.
DOI : 10.1007/3-540-63166-6_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.1920

Y. Gurevich, Sequential abstract-state machines capture sequential algorithms, ACM Transactions on Computational Logic, vol.1, issue.1
DOI : 10.1145/343369.343384
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.3017

]. C. Hoa69 and . Hoare, An axiomatic basis for computer programming, Com. of the ACM, vol.12, issue.10, pp.576-580, 1969.

K. Larsen and B. Thomsen, A modal process logic, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science, pp.203-210, 1988.
DOI : 10.1109/LICS.1988.5119

R. [. Namjoshi and . Kurshan, Syntactic Program Transformations for Automatic Abstraction, CAV, pp.435-449, 2000.
DOI : 10.1007/10722167_33

C. S. , R. Pelánek, and W. Visser, Predicate abstraction with under-approximation refinement, LMCS, vol.3, issue.15, pp.1-22, 2007.

C. S. and W. Visser, A survey of new trends in symbolic execution for software testing and analysis, STTT, vol.11, issue.4, pp.339-353, 2009.

N. Rapin, C. Gaston, A. Lapitre, and J. Gallois, Behavioral unfolding of formal specifications based on communicating extended automata, ATVA, 2003.

K. Sen, D. Marinov, and G. Agha, CUTE: a concolic unit testing engine for C, ESEC/SIGSOFT FSE, pp.263-272, 2005.
DOI : 10.1145/1321631.1321746

N. Tillmann and J. De-halleux, Pex???White Box Test Generation for .NET, LNCS, vol.4966, pp.134-153, 2008.
DOI : 10.1007/978-3-540-79124-9_10

[. Veanes and R. Yavorsky, Combined algorithm for approximating a finite state abstraction of a large system, ICSE 2003/Scenarios Workshop, pp.86-91, 2003.

F. Institute and F. Institute, 33 3) 63 08 24 00 ? e-mail: contact@femto-st.fr FEMTO-ST ? AS2M: TEMIS, 24 rue Alain Savary, F-25000 Besançon France FEMTO-ST ? DISC: UFR Sciences -Route de Gray -F-25030 Besançon cedex France FEMTO-ST ? ENERGIE: Parc Technologique, 2 Av Rue des entrepreneurs, F-90000 Belfort France FEMTO-ST ? MEC'APPLI: 24, chemin de l'´ epitaphe -F-25000, 15B Avenue des Montboucons -F-25030 Besançon cedex France FEMTO-ST ? OPTIQUE: 15B Avenue des Montboucons -F-25030 Besançon cedex France FEMTO-ST ? TEMPS-FREQUENCE: 26