B. K. Aichernig and P. A. Salas, Test Case Generation by OCL Mutation and Constraint Solving, Fifth International Conference on Quality Software (QSIC'05), pp.64-71, 2005.
DOI : 10.1109/QSIC.2005.63
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.506.3130

E. Alkassar, N. Schirmer, and A. Starostin, Formal Pervasive Verification of a Paging Mechanism, Ramakrishnan and Rehof [129], pp.109-123
DOI : 10.1007/978-3-540-78800-3_9

S. Anand, C. S. Pasareanu, and W. Visser, JPF???SE: A Symbolic Execution Extension to Java PathFinder, Grumberg and Huth [79], pp.134-138
DOI : 10.1007/978-3-540-71209-1_12

K. Anastasakis, B. Bordbar, G. Georg, and I. Ray, UML2Alloy: A Challenging Model Transformation, MoDELS, pp.436-450, 2007.
DOI : 10.1007/978-3-540-75209-7_30

J. Avigad, K. Donnelly, D. Gray, and P. Raff, A formally verified proof of the prime number theorem, ACM Transactions on Computational Logic, vol.9, issue.1, 2007.
DOI : 10.1145/1297658.1297660

M. Barnett, K. Leino, and W. Schulte, The Spec# Programming System: An Overview, Construction and Analysis of Safe, Secure, and Interoperable Smart Devices, pp.49-69, 2005.
DOI : 10.1007/978-3-540-30569-9_3

R. Bayer, Symmetric binary B-Trees: Data structure and maintenance algorithms, Acta Informatica, vol.1, issue.4, pp.290-306, 1972.
DOI : 10.1007/BF00289509

S. Berghofer and T. Nipkow, Executing Higher Order Logic, Lecture Notes in Computer Science, vol.2277, pp.24-40, 2000.
DOI : 10.1007/3-540-45842-5_2

S. Berghofer and T. Nipkow, Random testing in Isabelle/HOL, Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004., pp.230-239, 2004.
DOI : 10.1109/SEFM.2004.1347524

G. Bernot, M. C. Gaudel, and B. Marre, Software testing based on formal specifications: a theory and a tool, Software Engineering Journal, vol.6, issue.6, pp.387-405, 1991.
DOI : 10.1049/sej.1991.0040

D. L. Berre and A. Parrain, The Sat4j library, release 2.2, JSAT, vol.7, issue.2-3, pp.59-64, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00868136

J. Blanchette, Relational analysis of (co)inductive predicates, (co)algebraic datatypes, and (co)recursive functions, Software Quality Journal

J. C. Blanchette and T. Nipkow, Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder, Kaufmann and Paulson [92], pp.131-146
DOI : 10.1007/978-3-642-14052-5_11

S. Böhme and T. Weber, Fast LCF-Style Proof Reconstruction for Z3, pp.179-194
DOI : 10.1007/978-3-642-14052-5_14

M. Boshernitsan, R. Doong, and A. Savoia, From daikon to agitator, Proceedings of the 2006 international symposium on Software testing and analysis , ISSTA'06, pp.169-180, 2006.
DOI : 10.1145/1146238.1146258

F. Bouquet, F. Dadeau, B. Legeard, and M. Utting, Symbolic Animation of JML Specifications, Lecture Notes in Computer Science, vol.3582, pp.75-90, 2005.
DOI : 10.1007/11526841_7
URL : https://hal.archives-ouvertes.fr/inria-00329983

F. Bouquet, B. Legeard, and F. Peureux, CLPS???B ??? A constraint solver to animate a B specification, International Journal on Software Tools for Technology Transfer, vol.7, issue.2, pp.143-157, 2004.
DOI : 10.1007/s10009-003-0123-8

M. Bozzano, R. Bruttomesso, A. Cimatti, T. A. Junttila, S. Ranise et al., Efficient theory combination via boolean search, Information and Computation, vol.204, issue.10, pp.1493-1525, 2006.
DOI : 10.1016/j.ic.2005.05.011
URL : http://doi.org/10.1016/j.ic.2005.05.011

A. D. Brucker, L. Brügger, P. Kearney, and B. Wolff, Verified Firewall Policy Transformations for Test Case Generation, 2010 Third International Conference on Software Testing, Verification and Validation, pp.345-354, 2010.
DOI : 10.1109/ICST.2010.50

A. D. Brucker, L. Brügger, P. Kearney, and B. Wolff, An approach to modular and testable security models of real-world health-care applications, Proceedings of the 16th ACM symposium on Access control models and technologies, SACMAT '11, pp.133-142, 2011.
DOI : 10.1145/1998441.1998461

A. D. Brucker, L. Brügger, and B. Wolff, Model-Based Firewall Conformance Testing, Lecture Notes in Computer Science, vol.5, issue.2, pp.103-118, 2008.
DOI : 10.1007/11430230_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.184.6451

A. D. Brucker, M. P. Krieger, D. Longuet, and B. Wolff, A Specification-Based Test Case Generation Method for UML/OCL, MoDELS Workshops, pp.334-348, 2010.
DOI : 10.1023/A:1022920129859

A. D. Brucker, M. P. Krieger, and B. Wolff, Extending OCL with Null-References, Lecture Notes in Computer Science, vol.6002, pp.261-275, 2009.
DOI : 10.1007/978-3-642-12261-3_25

A. D. Brucker and B. Wolff, Symbolic Test Case Generation for Primitive Recursive Functions, Lecture Notes in Computer Science, vol.29, issue.4, pp.16-32, 2004.
DOI : 10.1145/267580.267590

A. D. Brucker and B. Wolff, Interactive Testing with HOL-TestGen, Lecture Notes in Computer Science, vol.10, issue.2, pp.87-102, 2005.
DOI : 10.1023/A:1022920129859

A. D. Brucker and B. Wolff, The HOL-OCL book, 2006.

A. D. Brucker and B. Wolff, Test-Sequence Generation with Hol-TestGen with an Application to Firewall Testing, Lecture Notes in Computer Science, vol.4454, pp.149-168, 2007.
DOI : 10.1007/978-3-540-73770-4_9

A. D. Brucker and B. Wolff, An Extensible Encoding of Object-oriented Data Models in hol, Journal of Automated Reasoning, vol.10, issue.2, pp.3-4219, 2008.
DOI : 10.1007/s10817-008-9108-3
URL : https://hal.archives-ouvertes.fr/hal-01214567

A. D. Brucker and B. Wolff, Semantics, calculi, and analysis for object-oriented specifications, Acta Informatica, vol.39, issue.2, pp.255-284, 2009.
DOI : 10.1007/s00236-009-0093-8
URL : https://hal.archives-ouvertes.fr/hal-01214519

A. D. Brucker and B. Wolff, On theorem prover-based testing. Formal Aspects of Computing, 2011.

R. Brummayer and A. Biere, Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays, Conclusion TACAS Lecture Notes in Computer Science, vol.10, issue.5505, pp.174-177, 2009.
DOI : 10.1007/978-3-540-78800-3_24

R. Brummayer and A. Biere, Effective Bit-Width and Under-Approximation, Lecture Notes in Computer Science, vol.5717, pp.304-311, 2009.
DOI : 10.1007/978-3-540-45069-6_34

R. Brummayer and A. Biere, Lemmas on demand for the extensional theory of arrays, Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning, SMT '08/BPR '08, pp.165-201, 2009.
DOI : 10.1145/1512464.1512467

R. Bruttomesso, A. Cimatti, A. Franzén, A. Griggio, Z. Hanna et al., A Lazy and Layered SMT( $\mathcal{BV}$ ) Solver for Hard Industrial Verification Problems, Damm and Hermanns [55], pp.547-560
DOI : 10.1007/978-3-540-73368-3_54

R. E. Bryant, D. Kroening, J. Ouaknine, S. A. Seshia, O. Strichman et al., An abstraction-based decision procedure for bit-vector arithmetic, International Journal on Software Tools for Technology Transfer, vol.11, issue.2, pp.95-104, 2009.
DOI : 10.1007/s10009-009-0101-x

J. Cabot, R. Clarisó, and D. Riera, Verifying UML/OCL Operation Contracts, Lecture Notes in Computer Science, vol.30, issue.4, pp.40-55, 2009.
DOI : 10.1145/299917.299919

M. Cadoli and A. Schaerf, Compiling problem specifications into SAT, Artificial Intelligence, vol.162, issue.1-2, pp.89-120, 2005.
DOI : 10.1016/j.artint.2004.01.006

M. Carlier and C. Dubois, Functional Testing in the Focal Environment, Lecture Notes in Computer Science, vol.4966, pp.84-98, 2008.
DOI : 10.1007/978-3-540-79124-9_7
URL : https://hal.archives-ouvertes.fr/hal-01125411

M. Carlier, C. Dubois, and A. Gotlieb, Constraint reasoning in FocalTest, pp.82-91, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00699233

N. Cataño and T. Wahls, Executing JML specifications of Java card applications, Proceedings of the 2009 ACM symposium on Applied Computing, SAC '09, pp.404-408
DOI : 10.1145/1529282.1529373

A. Chaieb and T. Nipkow, Proof Synthesis and Reflection for Linear Arithmetic, Journal of Automated Reasoning, vol.10, issue.5, pp.33-59, 2008.
DOI : 10.1007/s10817-008-9101-x

P. Chalin and F. Rioux, Non-null references by default in the Java modeling language, Proceedings of the 2005 conference on Specification and verification of component-based systems, SAVCBS '05, 2005.

J. Christiansen and S. Fischer, EasyCheck ??? Test Data for Free, Lecture Notes in Computer Science, vol.4989, pp.322-336, 2008.
DOI : 10.1007/978-3-540-78969-7_23

A. Church, A formulation of the simple theory of types, The Journal of Symbolic Logic, vol.1, issue.02, pp.56-68, 1940.
DOI : 10.2307/2371199

K. Claessen and J. Hughes, Quickcheck: a lightweight tool for random testing of haskell programs, ICFP, pp.268-279, 2000.

K. Claessen and N. Sörensson, New techniques that improve MACE-style finite model finding, Proc. Wsh. Model Computation ? Principles, 2003.

T. Clark and J. Warmer, Object Modeling with the OCL: The Rationale behind the Object Constraint Language, Lecture Notes in Computer Science, vol.2263, 2002.
DOI : 10.1007/3-540-45669-4

E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, Counterexample-guided abstraction refinement for symbolic model checking, Journal of the ACM, vol.50, issue.5, pp.752-794, 2003.
DOI : 10.1145/876638.876643

S. Cook, A. Kleppe, R. Mitchell, B. Rumpe, J. Warmer et al., The Amsterdam Manifesto on OCL, Clark and Warmer [51], pp.115-149
DOI : 10.1007/3-540-45669-4_7

S. Cook and P. Nguyen, Logical Foundations of Proof Complexity, 2010.
DOI : 10.1017/CBO9780511676277

M. Davis, Hilbert's Tenth Problem is Unsolvable, The American Mathematical Monthly, vol.80, issue.3, p.80, 1973.
DOI : 10.2307/2318447

M. Davis, G. Logemann, and D. W. Loveland, A machine program for theorem-proving, Communications of the ACM, vol.5, issue.7, pp.394-397, 1962.
DOI : 10.1145/368273.368557

L. M. De-moura and N. Bjørner, Z3: An Efficient SMT Solver, pp.337-340
DOI : 10.1007/978-3-540-78800-3_24

D. Detlefs, G. Nelson, and J. B. Saxe, Simplify: a theorem prover for program checking, Journal of the ACM, vol.52, issue.3, pp.365-473, 2005.
DOI : 10.1145/1066100.1066102

A. Dick, P. Krause, and J. Cozens, Computer Aided Transformation of Z into Prolog, Proc. 4 th Z Users Workshop, Workshops in Computing, pp.71-85, 1989.
DOI : 10.1007/978-1-4471-3877-8_5

J. Dick and A. Faivre, Automating the generation and sequencing of test cases from model-based specifications, Lecture Notes in Computer Science, vol.670, pp.268-284, 1993.
DOI : 10.1007/BFb0024651

V. Doma and R. A. Nicholl, EZ: A system for automatic prototyping of Z specifications, Europe Lecture Notes in Computer Science, vol.551, issue.1, pp.189-203, 1991.
DOI : 10.1007/3-540-54834-3_13

N. Eén and N. Sörensson, An Extensible SAT-solver, Lecture Notes in Computer Science, vol.2919, pp.502-518, 2003.
DOI : 10.1007/978-3-540-24605-3_37

S. Flake, Towards the completion of the formal semantics of OCL 2.0, CRPIT, vol.26, pp.73-82, 2004.

C. Flanagan, R. Joshi, X. Ou, and J. B. Saxe, Theorem Proving Using Lazy Proof Explication, Lecture Notes in Computer Science, vol.2725, pp.355-367, 2003.
DOI : 10.1007/978-3-540-45069-6_34

R. Fourer, D. M. Gay, and B. W. Kernighan, AMPL: A Modeling Language for Mathematical Programming, 2002.

A. M. Frisch and P. J. Stuckey, The Proper Treatment of Undefinedness in Constraint Languages, Lecture Notes in Computer Science, vol.13, pp.367-382, 2009.
DOI : 10.1007/s10601-008-9047-y

D. Gale and L. S. Shapley, College Admissions and the Stability of Marriage, The American Mathematical Monthly, vol.69, issue.1, pp.9-15, 1962.
DOI : 10.2307/2312726

V. Ganesh and D. L. Dill, A Decision Procedure for Bit-Vectors and Arrays, Damm and Hermanns [55], pp.519-531
DOI : 10.1007/978-3-540-73368-3_52

Y. Ge and L. M. De-moura, Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories, Lecture Notes in Computer Science, vol.5643, pp.306-320, 2009.
DOI : 10.1007/978-3-642-02658-4_25

M. Gogolla, F. Büttner, M. Richters, U. , and O. Sci, USE: A UML-based specification environment for validating, Comp. Prog, vol.69, pp.1-327, 2007.

M. Gogolla, L. Hamann, and M. Kuhlmann, Proving and Visualizing OCL Invariant Independence by Automatically Generated Test Cases, Lecture Notes in Computer Science, vol.6143, pp.38-54, 2010.
DOI : 10.1007/978-3-642-13977-2_5

M. Gogolla, M. Kuhlmann, and F. Büttner, A Benchmark for OCL Engine Accuracy, Determinateness, and Efficiency
DOI : 10.1007/978-3-540-87875-9_32

M. Gogolla and M. Richters, Expressing UML Class Diagrams Properties with OCL, pp.85-114
DOI : 10.1007/3-540-45669-4_6

G. Gottlob, C. Koch, and R. Pichler, Efficient algorithms for processing XPath queries, VLDB, pp.95-106, 2002.

J. Gray and S. Schach, Constraint animation using an object-oriented declarative language, Proceedings of the 38th annual on Southeast regional conference , ACM-SE 38, pp.1-10, 2000.
DOI : 10.1145/1127716.1127718

W. Grieskamp, A Computation Model for Z Based on Concurrent Constraint Resolution, Lecture Notes in Computer Science, vol.1878, pp.414-432, 2000.
DOI : 10.1007/3-540-44525-0_24

H. Grönniger, J. O. Ringert, and B. Rumpe, System Model-Based Definition of Modeling Language Semantics, Lecture Notes in Computer Science, vol.11, issue.2, pp.152-166, 2009.
DOI : 10.1145/505145.505149

O. Grumberg and M. Huth, Tools and Algorithms for the Construction and Analysis of Systems Held as Part of the Joint European Conferences on Theory and Practice of Software, 13th International Conference Proceedings, 2007.

G. Heiser, K. Elphinstone, I. Kuz, G. Klein, and S. M. Petters, Towards trustworthy computing systems, ACM SIGOPS Operating Systems Review, vol.41, issue.4, pp.3-11, 2007.
DOI : 10.1145/1278901.1278904

R. Hennicker, A. Knapp, and H. Baumeister, Semantics of OCL Operation Specifications, Electronic Notes in Theoretical Computer Science, vol.102, pp.111-132, 2004.
DOI : 10.1016/j.entcs.2003.09.006

A. Huima, Implementing Conformiq Qtronic, Lecture Notes in Computer Science, vol.4581, pp.1-12, 2007.
DOI : 10.1007/978-3-540-73066-8_1

H. Hußmann, B. Demuth, and F. Finger, Modular architecture for a toolset supporting OCL, Science of Computer Programming, vol.44, issue.1, pp.51-69, 2002.
DOI : 10.1016/S0167-6423(02)00032-1

D. Jackson, Alloy: a lightweight object modelling notation, ACM Transactions on Software Engineering and Methodology, vol.11, issue.2, pp.256-290, 2002.
DOI : 10.1145/505145.505149

D. Jackson, Software Abstractions: Logic, Language, and Analysis, 2006.

D. Jackson and C. Damon, Elements of style: Analyzing a software design feature with a counterexample detector, ISSTA, pp.239-249, 1996.

E. Jaffuel and B. Legeard, LEIRIOS Test Generator: Automated Test Generation from B Models, Julliand and Kouchnarenko [90], pp.277-280
DOI : 10.1007/11955757_29

C. Jard and T. Jéron, TGV: theory, principles and algorithms, International Journal on Software Tools for Technology Transfer, vol.17, issue.4, pp.297-315, 2005.
DOI : 10.1007/s10009-004-0153-x

J. Julliand and O. Kouchnarenko, Formal Specification and Development in B, 7th International Conference of B Users, Proceedings, 2006.

S. Khurshid and D. Marinov, TestEra: Specification-Based Testing of Java Programs Using SAT, Automated Software Engineering, vol.11, issue.4, pp.403-434, 2004.
DOI : 10.1023/B:AUSE.0000038938.10589.b9

S. Khurshid, D. Marinov, and D. Jackson, An analyzable annotation language, OOPSLA, pp.231-245, 2002.

P. W. Koopman, A. Alimarine, J. Tretmans, and M. J. Plasmeijer, Gast: Generic Automated Software Testing, Lecture Notes in Computer Science, vol.2670, pp.84-100, 2002.
DOI : 10.1007/3-540-44854-3_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.1101

P. Kosiuczenko, Specification of Invariability in OCL, MoDELS, pp.676-691, 2006.
DOI : 10.1007/11880240_47

R. A. Kowalski, The early years of logic programming, Communications of the ACM, vol.31, issue.1, pp.38-43, 1988.
DOI : 10.1145/35043.35046

J. Krají?ek, Bounded arithmetic, propositional logic, and complexity theory, 1995.
DOI : 10.1017/CBO9780511529948

B. Krause and T. Wahls, jmle: A Tool for Executing JML Specifications Via Constraint Programming, FMICS/PDMC, pp.293-296, 2006.
DOI : 10.1007/978-3-540-70952-7_19

A. Krauss, Automating Recursive Definitions and Termination Proofs in Higher-Order Logic, 2009.

M. P. Krieger and A. D. Brucker, Extending OCL operation contracts with objective functions, ECEASST, p.44, 2011.

M. P. Krieger, A. Knapp, and B. Wolff, Automatic and efficient simulation of operation contracts, pp.53-62, 2010.

M. Kuhlmann, L. Hamann, and M. Gogolla, Extensive Validation of OCL Models by Integrating SAT Solving into USE, Lecture Notes in Computer Science, vol.6705, issue.49, pp.290-306, 2011.
DOI : 10.1007/978-3-642-21952-8_21

S. K. Lahiri and S. A. Seshia, The UCLID Decision Procedure, Lecture Notes in Computer Science, vol.3114, pp.475-478, 2004.
DOI : 10.1007/978-3-540-27813-9_40

G. T. Leavens, E. Poll, C. Clifton, Y. Cheon, C. Ruby et al., JML reference manual (revision 1.2), Feb Available from http, 2007.

K. R. Leino and R. Monahan, Reasoning about comprehensions with first-order SMT solvers, Proceedings of the 2009 ACM symposium on Applied Computing, SAC '09, pp.615-622
DOI : 10.1145/1529282.1529411

M. Leuschel and M. Butler, ProB: an automated analysis toolset for the B method, International Journal on Software Tools for Technology Transfer, vol.49, issue.3, pp.185-203, 2008.
DOI : 10.1007/s10009-007-0063-9

B. Li, Z. Shu-li, L. Qing, and Y. Chen, Test Case Automate Generation from UML Sequence Diagram and OCL Expression, 2007 International Conference on Computational Intelligence and Security (CIS 2007), pp.1048-1052, 2007.
DOI : 10.1109/CIS.2007.150

S. Markovic and T. Baar, Semantics of OCL specified with QVT. Software and System Modeling, pp.399-422, 2008.

B. Marre, LOFT: A tool for assisting selection of test data sets from algebraic specifications, Lecture Notes in Computer Science, vol.915, pp.799-800, 1995.
DOI : 10.1007/3-540-59293-8_240

D. C. Matthews and M. Wenzel, Efficient parallel programming in Poly, pp.53-62, 2010.

A. Milicevic, D. Rayside, K. Yessenov, and D. Jackson, Unifying execution of imperative and declarative code, Proceeding of the 33rd international conference on Software engineering, ICSE '11, pp.511-520, 2011.
DOI : 10.1145/1985793.1985863

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff, Proceedings of the 38th conference on Design automation , DAC '01, pp.530-535, 2001.
DOI : 10.1145/378239.379017

G. Myers, The art of software testing. Business data processing, 1979.

G. Nelson and D. C. Oppen, Simplification by Cooperating Decision Procedures, ACM Transactions on Programming Languages and Systems, vol.1, issue.2, pp.245-257, 1979.
DOI : 10.1145/357073.357079

I. Niemelä, Logic programs with stable model semantics as a constraint programming paradigm, Annals of Mathematics and Artificial Intelligence, vol.25, issue.3/4, pp.241-273, 1999.
DOI : 10.1023/A:1018930122475

R. Nieuwenhuis and A. Oliveras, DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic, Lecture Notes in Computer Science, vol.3576, pp.321-334, 2005.
DOI : 10.1007/11513988_33

T. Nipkow, G. Bauer, and P. Schultz, Flyspeck I: Tame Graphs, Lecture Notes in Computer Science, vol.4130, pp.21-35, 2006.
DOI : 10.1007/11814771_4

T. Nipkow, L. C. Paulson, and M. Wenzel, Isabelle/HOL ? A Proof Assistant for Higher-Order Logic, LNCS, vol.2283, 2002.

S. Noikajana and T. Suwannasart, An Improved Test Case Generation Method for Web Service Testing from WSDL-S and OCL with Pair-Wise Testing Technique, 2009 33rd Annual IEEE International Computer Software and Applications Conference, pp.115-123, 2009.
DOI : 10.1109/COMPSAC.2009.25

I. Oliver and S. Kent, Validation of object oriented models using animation, Proceedings 25th EUROMICRO Conference. Informatics: Theory and Practice for the New Millennium, p.2237, 1999.
DOI : 10.1109/EURMIC.1999.794786

L. Paulson, ML for the working programmer, 1996.
DOI : 10.1017/CBO9780511811326

L. C. Paulson, The relative consistency of the axiom of choice ? mechanized using Isabelle/ZF, LMS Journal of Computation and Mathematics, vol.6, 1999.

L. C. Paulson and K. W. Susanto, Source-Level Proof Reconstruction for Interactive Theorem Proving, Lecture Notes in Computer Science, vol.4732, pp.232-245, 2007.
DOI : 10.1007/978-3-540-74591-4_18

C. R. Ramakrishnan and J. Rehof, Tools and Algorithms for the Construction and Analysis of Systems Held as Part of the Joint European Conferences on Theory and Practice of Software, 14th International Conference Proceedings, volume 4963 of Lecture Notes in Computer Science, 2008.

M. Richters, A Precise Approach to Validating UML Models and OCL Constraints, 2002.

B. Rumpe, Model-Based Testing of Object-Oriented Systems, Lecture Notes in Computer Science, vol.2852, pp.380-402, 2002.
DOI : 10.1007/978-3-540-39656-7_16

R. Sebastiani, Lazy satisability modulo theories, JSAT, vol.3, issue.3-4, pp.141-224, 2007.

T. Servat, BRAMA: A New Graphic Animation Tool for B Models, Julliand and Kouchnarenko [90], pp.274-276
DOI : 10.1007/11955757_28

S. A. Seshia and R. E. Bryant, Deciding quantifier-free presburger formulas using parameterized solution bounds, Logical Methods in Computer Science, vol.1, issue.2, 2005.
DOI : 10.1109/lics.2004.1319604
URL : http://arxiv.org/abs/cs/0508044

L. Shan and H. Zhu, A Formal Descriptive Semantics of UML, Lecture Notes in Computer Science, vol.5256, pp.375-396, 2008.
DOI : 10.1007/978-3-540-88194-0_23

I. Shlyakhter, M. Sridharan, R. Seater, and D. Jackson, Exploiting subformula sharing in automatic analysis of quantified formulas, Sel. Rev. Papers 6 th Int. Conf. Theory and Applications of Satisfiability Testing (SAT'03), volume 2919 of Lecture Notes in Computer Science, 2004.

J. P. Silva, The Impact of Branching Heuristics in Propositional Satisfiability Algorithms, Lecture Notes in Computer Science, vol.1695, pp.62-74, 1999.
DOI : 10.1007/3-540-48159-1_5

N. Tamura, A. Taga, S. Kitagawa, and M. Banbara, Compiling finite linear CSP into SAT, Constraints, vol.64, issue.2, pp.254-272, 2009.
DOI : 10.1007/s10601-008-9061-0

N. Tamura, T. Tanjo, and M. Banbara, Solving Constraint Satisfaction Problems with SAT Technology, Lecture Notes in Computer Science, vol.6009, pp.19-23, 2010.
DOI : 10.1007/978-3-642-12251-4_3

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

C. Tinelli and M. T. Harandi, A New Correctness Proof of the Nelson-Oppen Combination Procedure, Frontiers of Combining Systems (FroCos), pp.103-119, 1996.
DOI : 10.1007/978-94-009-0349-4_5

E. Torlak and D. Jackson, Kodkod: A Relational Model Finder, Grumberg and Huth [79], pp.632-647
DOI : 10.1007/978-3-540-71209-1_49

J. Tretmans, Test generation with inputs, outputs and repetitive quiescence . Software -Concepts and Tools, pp.103-120, 1996.

G. Tseitin, On the complexity of proofs in propositional logics Automation of Reasoning: Classical Papers in Computational Logic, 1967.

M. Utting, Data structures for Z testing tools, Proc. 4 th Wsh. Tools for System Design and Verification (FM-TOOLS'00, 2000.

L. Van-aertryck and T. Jensen, UML-CASTING: Test synthesis from UML models using constraint resolution INRIA, Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL'2003, 2003.

M. Veanes, C. Campbell, W. Grieskamp, W. Schulte, N. Tillmann et al., Model-Based Testing of Object-Oriented Reactive Systems with Spec Explorer, Formal Methods and Testing, pp.39-76, 2008.
DOI : 10.1007/978-3-540-78917-8_2

M. Veanes, P. Grigorenko, P. De-halleux, and N. Tillmann, Symbolic Query Exploration, Lecture Notes in Computer Science, vol.5885, pp.49-68, 2009.
DOI : 10.1007/978-3-642-10373-5_3

M. Veanes, N. Tillmann, and J. De-halleux, Qex: Symbolic SQL Query Explorer, LPAR (Dakar), pp.425-446, 2010.
DOI : 10.1007/978-3-642-17511-4_24
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.187.7962

T. Weber and H. Amjad, Efficiently checking propositional refutations in HOL theorem provers, Journal of Applied Logic, vol.7, issue.1, pp.26-40, 2009.
DOI : 10.1016/j.jal.2007.07.003

S. Weißleder and B. Schlingloff, Quality of Automatically Generated Test Cases based on OCL Expressions, 2008 International Conference on Software Testing, Verification, and Validation, pp.517-520, 2008.
DOI : 10.1109/ICST.2008.40

M. Wenzel, Isar ??? A Generic Interpretative Approach to Readable Formal Proof Documents, Lecture Notes in Computer Science, vol.1690, pp.167-184, 1999.
DOI : 10.1007/3-540-48256-3_12

L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik, Efficient conflict driven learning in boolean satisfiability solver, ICCAD, pp.279-285, 2001.