| Publication | Date of Publication | Type |
|---|
Closing the performance gap between doubles and rationals for octagons
Static Analysis | 2023-05-26 | Paper |
Compact Difference Bound Matrices
Programming Languages and Systems | 2022-12-09 | Paper |
Mind the gap: bit-vector interpolation recast over linear integer arithmetic
Tools and Algorithms for the Construction and Analysis of Systems | 2022-10-13 | Paper |
Reducing bit-vector polynomials to SAT using Gröbner bases
| 2021-04-07 | Paper |
Incremental closure for systems of two variables per inequality
Theoretical Computer Science | 2019-03-26 | Paper |
Inferring non-suspension conditions for logic programs with dynamic scheduling
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Partial evaluation of string obfuscations for Java malware detection
Formal Aspects of Computing | 2017-02-14 | Paper |
From MinX to MinC: semantics-driven decompilation of recursive datatypes
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-10-24 | Paper |
Range and set abstraction using SAT
Electronic Notes in Theoretical Computer Science | 2016-06-17 | Paper |
Quadtrees as an abstract domain
Electronic Notes in Theoretical Computer Science | 2016-06-17 | Paper |
Abstracting numeric constraints with Boolean functions
Information Processing Letters | 2016-06-16 | Paper |
Simple and efficient algorithms for octagons
Programming Languages and Systems | 2016-02-26 | Paper |
Partial evaluation for Java malware detection
Logic-Based Program Synthesis and Transformation | 2015-10-02 | Paper |
Semantics for Prolog with cut -- revisited
Functional and Logic Programming | 2014-07-24 | Paper |
Abstract interpretation of microcontroller code: intervals meet congruences
Science of Computer Programming | 2014-04-02 | Paper |
Transfer function synthesis without quantifier elimination
Logical Methods in Computer Science | 2012-09-25 | Paper |
Mutual Exclusion by Interpolation
Functional and Logic Programming | 2012-07-20 | Paper |
A pearl on SAT and SMT solving in Prolog
Theoretical Computer Science | 2012-06-25 | Paper |
The two variable per inequality abstract domain
Higher-Order and Symbolic Computation | 2012-01-13 | Paper |
RedAlert: Determinacy inference for Prolog
Theory and Practice of Logic Programming | 2011-08-16 | Paper |
Transfer function synthesis without quantifier elimination
Programming Languages and Systems | 2011-05-19 | Paper |
Analyzing string buffers in C
Algebraic Methodology and Software Technology | 2011-05-06 | Paper |
Two variables per linear inequality as an abstract domain
Logic Based Program Synthesis and Transformation | 2011-03-04 | Paper |
Automatic abstraction for intervals using Boolean formulae
Static Analysis | 2010-10-01 | Paper |
A Pearl on SAT Solving in Prolog
Functional and Logic Programming | 2010-05-04 | Paper |
Automatic Abstraction for Congruences
Lecture Notes in Computer Science | 2010-01-14 | Paper |
Logahedra: a new weakly relational domain
Automated Technology for Verification and Analysis | 2009-12-01 | Paper |
Logic Programming
Lecture Notes in Computer Science | 2009-08-06 | Paper |
Taming the Wrapping of Integer Arithmetic
Static Analysis | 2009-03-03 | Paper |
Inferring Congruence Equations Using SAT
Computer Aided Verification | 2008-07-15 | Paper |
Widening Polyhedra with Landmarks
Programming Languages and Systems | 2008-05-06 | Paper |
Detecting Determinacy in Prolog Programs
Logic Programming | 2008-03-11 | Paper |
Collapsing Closures
Logic Programming | 2008-03-11 | Paper |
Functional and Logic Programming
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Lazy Set-Sharing Analysis
Functional and Logic Programming | 2007-05-02 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Static Analysis
Lecture Notes in Computer Science | 2006-10-31 | Paper |
Control generation by program transformation
| 2006-06-19 | Paper |
Program Development in Computational Logic
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Program Development in Computational Logic
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Computing convex hulls with a linear solver
Theory and Practice of Logic Programming | 2005-04-29 | Paper |
Convex hull of planarh-polyhedra
International Journal of Computer Mathematics | 2004-12-29 | Paper |
scientific article; zbMATH DE number 2085273 (Why is no real title available?)
| 2004-08-09 | Paper |
Efficient groundness analysis in Prolog
Theory and Practice of Logic Programming | 2004-03-01 | Paper |
A backward analysis for constraint logic programs
Theory and Practice of Logic Programming | 2004-03-01 | Paper |
Three optimisations for sharing
Theory and Practice of Logic Programming | 2004-03-01 | Paper |
Verifying termination and error-freedom of logic programs with block declarations
Theory and Practice of Logic Programming | 2004-03-01 | Paper |
scientific article; zbMATH DE number 1956547 (Why is no real title available?)
| 2003-07-30 | Paper |
scientific article; zbMATH DE number 1948390 (Why is no real title available?)
| 2003-07-13 | Paper |
scientific article; zbMATH DE number 1678390 (Why is no real title available?)
| 2001-12-04 | Paper |
scientific article; zbMATH DE number 1615253 (Why is no real title available?)
| 2001-07-08 | Paper |
scientific article; zbMATH DE number 1615255 (Why is no real title available?)
| 2001-07-08 | Paper |
Pair-sharing over rational trees
The Journal of Logic Programming | 2000-12-12 | Paper |
scientific article; zbMATH DE number 1538027 (Why is no real title available?)
| 2000-12-03 | Paper |
scientific article; zbMATH DE number 1538024 (Why is no real title available?)
| 2000-12-03 | Paper |
A simple polynomial groundness analysis for logic programs
The Journal of Logic Programming | 2000-10-10 | Paper |
scientific article; zbMATH DE number 1420803 (Why is no real title available?)
| 2000-08-28 | Paper |
