| Publication | Date of Publication | Type |
|---|
Revisiting polyhedral analysis for hybrid systems
| 2024-04-19 | Paper |
Symbolic analysis of linear hybrid automata -- 25 years later
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Decoupling the ascending and descending phases in abstract interpretation
Programming Languages and Systems | 2023-07-25 | Paper |
An efficient abstract domain for not necessarily closed polyhedra
Static Analysis | 2023-05-26 | Paper |
A direct encoding for NNC polyhedra
Computer Aided Verification | 2023-05-26 | Paper |
On the efficiency of convex polyhedra
| 2022-04-25 | Paper |
Synthesis of P-stable abstractions
| 2021-07-08 | Paper |
PPLite: zero-overhead encoding of NNC polyhedra
Information and Computation | 2020-12-15 | Paper |
Efficient constraint/generator removal from double description of polyhedra
| 2016-05-10 | Paper |
A new look at the automatic synthesis of linear ranking functions
Information and Computation | 2012-10-11 | Paper |
Boolean functions for finite-tree dependencies
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-05-06 | Paper |
Exact join detection for convex polyhedra and other numerical abstractions
Computational Geometry | 2010-03-11 | Paper |
Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness
Formal Methods in System Design | 2010-02-05 | Paper |
Applications of polyhedral computations to the analysis and verification of hardware and software systems
Theoretical Computer Science | 2009-11-04 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2009-05-15 | Paper |
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
Lecture Notes in Computer Science | 2008-04-04 | Paper |
Grids: A Domain for Analyzing the Distribution of Numerical Values
Logic-Based Program Synthesis and Transformation | 2007-09-10 | Paper |
Static Analysis
Lecture Notes in Computer Science | 2006-10-31 | Paper |
Static Analysis
Lecture Notes in Computer Science | 2006-10-31 | Paper |
Finite-tree analysis for constraint logic-based languages
Information and Computation | 2006-03-07 | Paper |
Not necessarily closed convex polyhedra and the double description method
Formal Aspects of Computing | 2005-12-13 | Paper |
Precise widening operators for convex polyhedra
Science of Computer Programming | 2005-10-10 | Paper |
Enhanced sharing analysis techniques: a comprehensive evaluation
Theory and Practice of Logic Programming | 2005-04-29 | Paper |
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages
Theory and Practice of Logic Programming | 2005-04-15 | Paper |
scientific article; zbMATH DE number 2090855 (Why is no real title available?)
| 2004-08-13 | Paper |
Soundness, idempotence and commutativity of set-sharing
Theory and Practice of Logic Programming | 2004-03-01 | Paper |
Decomposing non-redundant sharing by complementation
Theory and Practice of Logic Programming | 2004-03-01 | Paper |
scientific article; zbMATH DE number 1948398 (Why is no real title available?)
| 2003-07-13 | Paper |
scientific article; zbMATH DE number 1832223 (Why is no real title available?)
| 2002-11-19 | Paper |
scientific article; zbMATH DE number 1696766 (Why is no real title available?)
| 2002-07-22 | Paper |
Set-sharing is redundant for pair-sharing
Theoretical Computer Science | 2002-07-15 | Paper |
scientific article; zbMATH DE number 1487850 (Why is no real title available?)
| 2001-03-25 | Paper |
scientific article; zbMATH DE number 1487849 (Why is no real title available?)
| 2000-08-10 | Paper |
