Splitting on Demand in SAT Modulo Theories, Proceedings of the Thirteenth International Conference on Logic for Programming, Artificial Intelligence , and Reasoning (LPAR), pp.512-526, 2006. ,
DOI : 10.1007/11916277_35
On conflict-driven reasoning, Proceedings of the Sixth Workshop on Automated Formal Methods (AFM), at the Ninth NASA Formal Methods Symposium (NFM). pp. 1?9 ,
A model-constructing framework for theory combination, p.16, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01425305
Natural Domain SMT: A Preliminary Assessment, Proceedings of the Eighth International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS). Lecture Notes in Computer Science, pp.77-91, 2010. ,
DOI : 10.1007/978-3-642-15297-9_8
A Model-Constructing Satisfiability Calculus, Proceedings of the Fourteenth International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI). Lecture Notes in Computer Science, pp.1-12, 2013. ,
DOI : 10.1007/978-3-642-35873-9_1
Modularity and refinement in inference systems, 2004. ,
Deciding floating-point logic with systematic abstraction, Proceedings of the Twelfth International Conference on Formal Methods in Computer Aided Design (FM- CAD), 2012. ,
Solving Nonlinear Integer Arithmetic with MCSAT, Proceedings of the Eighteenth International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI), pp.330-346, 2017. ,
DOI : 10.1007/s002000050055
The design and implementation of the model-constructing satisfiability calculus, Proceedings of the Thirteenth Conference on Formal Methods in Computer Aided Design (FMCAD), p.16, 2013. ,
Cutting to the chase: solving linear integer arithmetic, Proceedings of the Twenty-Third International Conference on Automated Deduction (CADE), pp.338-353, 2011. ,
Solving non-linear arithmetic, Proceedings of the Sixth International Joint Conference on Automated Reasoning (IJCAR), pp.339-354, 2012. ,
Conflict Resolution, Proceedings of the Fifteenth International Conference on Principles and Practice of Constraint Programming (CP), pp.509-523, 2009. ,
DOI : 10.1007/11591191_3
Architecting solvers for SAT modulo theories: Nelson-Oppen with DPLL, Proceedings of the Sixth International Symposium on Frontiers of Combining Systems (FroCoS), pp.1-27, 2007. ,
Conflict-driven clause learning SAT solvers, Handbook of Satisfiability, pp.131-153, 2009. ,
Generalizing DPLL to Richer Logics, Proceedings of the Twenty-First International Conference on Computer Aided Verification (CAV). Lecture Notes in Computer Science, pp.462-476, 2009. ,
DOI : 10.1145/1146909.1146971
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
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination, Proceedings of the Twelfth International Conference on Logic for Programming , Artificial Intelligence, and Reasoning (LPAR), pp.322-336, 2005. ,
DOI : 10.1007/11591191_23
The LPSAT engine and its application to resource planning, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI), pp.310-316, 1999. ,
Deciding bit-vector formulas with mcSAT, Proceedings of the Nineteenth International Conference on Theory and Applications of Satisfiability Testing (SAT) ,