Publications
Filters: Author is Pascal Fontaine [Clear All Filters]
Modal Satisfiability via {SMT} Solving”, in Software, Services, and Systems, vol. 8950, 2015, p. 30-45.
, “ A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited”, in Proc. Conference on Automated Deduction (CADE), 2015.
, “ A Rewriting Approach to the Combination of Data Structures with Bridging Theories”, in Frontiers of Combining Systems ({FroCoS}), 2015.
, “ A Gentle Non-Disjoint Combination of Satisfiability Procedures”, in International Joint Conference on Automated Reasoning (IJCAR), 2014.
, “ Integrating SMT solvers in Rodin”, Science of Computer Programming, 2014.
, “ Satisfiability Modulo Non-Disjoint Combinations of Theories Connected via Bridging Functions”, in Automated Deduction: Decidability, Complexity, Tractability (ADDCT), 2014.
, “ Computing Prime Implicants”, in 13th Intl. Conf. Formal Methods for Computer-Aided Design (FMCAD 2013), Portland, OR, U.S.A., 2013.
, ““Frontiers of Combining Systems - 9th International Symposium, FroCoS 2013, Nancy, France, September 18-20, 2013. Proceedings”, FroCoS, vol. 8152. 2013.
{SyMT}: finding symmetries in {SMT} formulas”, in 11th Intl. Workshop on Satisfiability Modulo Theories (SMT 2013), Helsinki, Finland, 2013.
, “ Tableaux for Relation-Changing Modal Logics”, in Frontiers of Combining Systems, 2013.frocos13.pdf (369.18 KB)
, “ Combination of Disjoint Theories: Beyond Decidability”, in Intl. Joint Conf. Automated Reasoning (IJCAR 2012), Manchester, UK, 2012.
, “ SMT Solvers for Rodin”, in 3rd Intl. Conf. Abstract State Machines, Alloy, B, VDM, and Z (ABZ 2012), Pisa, Italy, 2012.
, “