| Publication | Date of Publication | Type |
|---|
| Non-emptiness test for automata over words indexed by the reals and rationals | 2025-01-20 | Paper |
| Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates | 2024-04-26 | Paper |
Universal first-order quantification over automata
Implementation and Application of Automata | 2024-02-28 | Paper |
Universal first-order quantification over automata
Implementation and Application of Automata | 2024-02-28 | Paper |
| Politeness for the theory of algebraic datatypes | 2022-11-09 | Paper |
Polite combination of algebraic datatypes
Journal of Automated Reasoning | 2022-10-24 | Paper |
| Quantifier simplification by unification in SMT | 2022-03-24 | Paper |
Congruence closure with free variables
Tools and Algorithms for the Construction and Analysis of Systems | 2020-08-05 | Paper |
| Theory combination: beyond equality sharing | 2020-06-04 | Paper |
| scientific article; zbMATH DE number 7178358 (Why is no real title available?) | 2020-03-09 | Paper |
Politeness and combination methods for theories with bridging functions
Journal of Automated Reasoning | 2020-03-03 | Paper |
Scalable fine-grained proofs for formula processing
Journal of Automated Reasoning | 2020-03-03 | Paper |
| Revisiting enumerative instantiation | 2019-09-16 | Paper |
NP-completeness of small conflict set generation for congruence closure
Formal Methods in System Design | 2018-01-08 | Paper |
Subtropical satisfiability
(available as arXiv preprint) | 2018-01-04 | Paper |
Scalable fine-grained proofs for formula processing
Automated Deduction – CADE 26 | 2017-09-22 | Paper |
Satisfiability checking and symbolic computation
ACM Communications in Computer Algebra | 2017-06-21 | Paper |
Satisfiability checking and symbolic computation
ACM Communications in Computer Algebra | 2017-06-21 | Paper |
A rewriting approach to the combination of data structures with bridging theories
Frontiers of Combining Systems | 2017-02-27 | Paper |
Adapting real quantifier elimination methods for conflict set computation
Frontiers of Combining Systems | 2017-02-27 | Paper |
\textsf{SC}\(^2\): satisfiability checking meets symbolic computation. (Project paper)
Lecture Notes in Computer Science | 2016-08-30 | Paper |
A polite non-disjoint combination method: theories with bridging functions revisited
Automated Deduction - CADE-25 | 2015-12-02 | Paper |
Modal Satisfiability via SMT Solving
Software, Services, and Systems | 2015-06-22 | Paper |
Combining Decision Procedures by (Model-)Equality Propagation
Electronic Notes in Theoretical Computer Science | 2015-03-19 | Paper |
A gentle non-disjoint combination of satisfiability procedures
Automated Reasoning | 2014-09-26 | Paper |
| Combining non-stably infinite, non-first order theories | 2013-09-25 | Paper |
Combination of disjoint theories: beyond decidability
Automated Reasoning | 2012-09-05 | Paper |
Combining decision procedures by (model-)equality propagation
Science of Computer Programming | 2012-07-20 | Paper |
Combining theories: the Ackerman and guarded fragments
Frontiers of Combining Systems | 2011-10-07 | Paper |
Compression of propositional resolution proofs via partial regularization
Lecture Notes in Computer Science | 2011-07-29 | Paper |
Exploiting symmetry in SMT problems
Lecture Notes in Computer Science | 2011-07-29 | Paper |
Combinations of Theories for Decidable Fragments of First-Order Logic
Frontiers of Combining Systems | 2010-01-07 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Logic for Programming, Artificial Intelligence, and Reasoning
Lecture Notes in Computer Science | 2005-11-10 | Paper |
| scientific article; zbMATH DE number 1980926 (Why is no real title available?) | 2003-09-15 | Paper |
| scientific article; zbMATH DE number 1956575 (Why is no real title available?) | 2003-07-30 | Paper |
