| Publication | Date of Publication | Type |
|---|
| The complexity gap in the static analysis of cache accesses grows if procedure calls are added | 2023-06-29 | Paper |
| Extending constraint-only representation of polyhedra with Boolean constraints | 2023-05-26 | Paper |
| Ascertaining uncertainty for efficient exact cache analysis | 2022-08-12 | Paper |
| Data abstraction: a general framework to handle program verification of data structures | 2022-06-17 | Paper |
| On the Complexity of Cache Analysis for Different Replacement Policies | 2020-02-11 | Paper |
| An Efficient Parametric Linear Programming Solver and Application to Polyhedral Projection | 2019-11-18 | Paper |
| Combining Forward and Backward Abstract Interpretation of Horn Clauses | 2019-09-16 | Paper |
| Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming | 2019-09-16 | Paper |
| On the decidability of the existence of polyhedral invariants in transition systems | 2019-05-21 | Paper |
| Cell morphing: from array programs to array-free Horn clauses | 2018-08-27 | Paper |
| A Survey of Satisfiability Modulo Theory | 2016-11-09 | Paper |
| Polyhedral Approximation of Multivariate Polynomials Using Handelman’s Theorem | 2016-03-23 | Paper |
| Program Analysis with Local Policy Iteration | 2016-03-23 | Paper |
| Automatic modular abstractions for linear constraints | 2015-07-03 | Paper |
| Implementing and reasoning about hash-consed data structures in Coq | 2015-06-23 | Paper |
| An abstract Monte-Carlo method for the analysis of probabilistic programs | 2015-03-17 | Paper |
| Stratified Static Analysis Based on Variable Dependencies | 2014-07-22 | Paper |
| Implementing Hash-Consed Structures in Coq | 2013-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4898674 | 2013-01-02 | Paper |
| Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs | 2012-10-22 | Paper |
| On the Generation of Positivstellensatz Witnesses in Degenerate Cases | 2011-08-17 | Paper |
| Improving Strategies via SMT Solving | 2011-05-19 | Paper |
| Automatic Modular Abstractions for Template Numerical Constraints | 2010-07-27 | Paper |
| A minimalistic look at widening operators | 2010-03-05 | Paper |
| On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure | 2009-06-30 | Paper |
| Optimal Abstraction on Real-Valued Programs | 2009-03-03 | Paper |
| Fatal Degeneracy in the Semidefinite Programming Approach to the Decision of Polynomial Inequalities | 2009-01-30 | Paper |
| A Quantifier Elimination Algorithm for Linear Real Arithmetic | 2009-01-27 | Paper |
| Programming Languages and Systems | 2006-10-20 | Paper |
| Computer Aided Verification | 2006-01-10 | Paper |
| Abstract interpretation of programs as Markov decision processes | 2005-10-10 | Paper |
| Programming Languages and Systems | 2005-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4813401 | 2004-08-13 | Paper |
| Abstracting cryptographic protocols with tree automata. | 2003-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414726 | 2003-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414387 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778698 | 2002-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2763684 | 2002-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2722069 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4494379 | 2000-12-11 | Paper |
