| Publication | Date of Publication | Type |
|---|
| Dissecting widening: separating termination from information | 2024-04-19 | Paper |
Transformation-Enabled Precondition Inference
Theory and Practice of Logic Programming | 2023-12-12 | Paper |
| Algorithm selection for dynamic symbolic execution: a preliminary study | 2022-03-23 | Paper |
Compiling CP subproblems to MDDs and d-DNNFs
Constraints | 2019-10-25 | Paper |
| Constraint programming for dynamic symbolic execution of JavaScript | 2019-10-14 | Paper |
An iterative approach to precondition inference using constrained Horn clauses
Theory and Practice of Logic Programming | 2018-12-04 | Paper |
| Exploiting sparsity in difference-bound matrices | 2018-08-27 | Paper |
Reference abstract domains and applications to string analysis
Fundamenta Informaticae | 2018-05-03 | Paper |
| A Benders decomposition approach to deciding modular linear integer arithmetic | 2017-11-15 | Paper |
Horn clauses as an intermediate representation for program analysis and transformation
Theory and Practice of Logic Programming | 2017-11-09 | Paper |
| Minimizing landscape resistance for habitat conservation | 2017-08-04 | Paper |
Weighted spanning tree constraint with explanations
Integration of AI and OR Techniques in Constraint Programming | 2016-06-27 | Paper |
A complete refinement procedure for regular separability of context-free languages
Theoretical Computer Science | 2016-04-01 | Paper |
An abstract domain of uninterpreted functions
Lecture Notes in Computer Science | 2016-03-23 | Paper |
Analyzing Array Manipulating Programs by Program Transformation
Logic-Based Program Synthesis and Transformation | 2015-10-02 | Paper |
scientific article; zbMATH DE number 6292613 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Failure tabled constraint logic programming by interpolation
Theory and Practice of Logic Programming | 2014-02-27 | Paper |
Unbounded model-checking with interpolation for regular language constraints
Tools and Algorithms for the Construction and Analysis of Systems | 2013-08-05 | Paper |
Solving difference constraints over modular arithmetic
Automated Deduction – CADE-24 | 2013-06-14 | Paper |
Estimating the overlap between dependent computations for automatic parallelization
Theory and Practice of Logic Programming | 2011-08-16 | Paper |
Information loss in knowledge compilation: a comparison of Boolean envelopes
Artificial Intelligence | 2010-09-02 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
UN-KLEENE BOOLEAN EQUATION SOLVING
International Journal of Foundations of Computer Science | 2007-04-25 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2007-02-12 | Paper |
| scientific article; zbMATH DE number 1954107 (Why is no real title available?) | 2003-07-28 | Paper |
Precise goal-independent abstract interpretation of constraint logic programs.
Theoretical Computer Science | 2003-07-01 | Paper |
| Precise goal-independent abstract interpretation of constraint logic programs | 2001-05-08 | Paper |
| scientific article; zbMATH DE number 773984 (Why is no real title available?) | 2000-07-04 | Paper |
Two classes of Boolean functions for dependency analysis
Science of Computer Programming | 2000-01-04 | Paper |
