| Publication | Date of Publication | Type |
|---|
| Abstract interpretation of indexed grammars | 2024-04-19 | Paper |
| Property-driven code obfuscations reinterpreting Jones-optimality in abstract interpretation | 2023-07-28 | Paper |
| Program analysis is harder than verification: a computability perspective | 2023-05-05 | Paper |
| Computing Abstract Distances in Logic Programs | 2022-08-25 | Paper |
| Formal framework for reasoning about the precision of dynamic analysis | 2021-10-18 | Paper |
| Sound up-to techniques and Complete abstract domains | 2021-01-20 | Paper |
| Code Obfuscation Against Abstract Model Checking Attacks | 2020-07-07 | Paper |
| Code obfuscation against abstraction refinement attacks | 2018-11-16 | Paper |
| Completeness in approximate transduction | 2018-08-27 | Paper |
| Refining and compressing abstract domains | 2018-07-04 | Paper |
| “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics | 2017-11-16 | Paper |
| Making abstract domains condensing | 2017-07-12 | Paper |
| Maximal incompleteness as obfuscation potency | 2017-02-14 | Paper |
| Complementing logic program semantics | 2017-01-19 | Paper |
| Weakening additivity in adjoining closures | 2016-12-16 | Paper |
| Analyzing program analyses | 2016-09-29 | Paper |
| Abstract symbolic automata: mixed syntactic/semantic similarity analysis of executables | 2016-09-29 | Paper |
| Making abstract models complete | 2016-07-28 | Paper |
| Abstract non-interference | 2015-11-11 | Paper |
| What You Lose is What You Leak: Information Leakage in Declassification Policies | 2015-07-10 | Paper |
| Unveiling metamorphism by abstract interpretation of code properties | 2015-04-01 | Paper |
| Correctness kernels of abstract interpretations | 2014-07-18 | Paper |
| A Formal Framework for Property-Driven Obfuscation Strategies | 2013-08-16 | Paper |
| Refining and Compressing Abstract Model Checking1 1The work is partially supported by MURST project: Certificazione automatica di programmi mediante interpretazione astratta. | 2013-05-24 | Paper |
| An abstract interpretation-based model for safety semantics | 2011-04-21 | Paper |
| Modelling Metamorphism by Abstract Interpretation | 2010-10-01 | Paper |
| Example-Guided Abstraction Simplification | 2010-09-07 | Paper |
| Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming | 2010-07-20 | Paper |
| A proof system for abstract non-interference | 2010-04-21 | Paper |
| Abstract interpretation of resolution-based semantics | 2009-11-04 | Paper |
| Opaque Predicates Detection by Abstract Interpretation | 2009-04-28 | Paper |
| Transforming Abstract Interpretations by Abstract Interpretation | 2008-08-28 | Paper |
| Hiding Software Watermarks in Loop Structures | 2008-08-28 | Paper |
| Making abstract interpretations complete | 2008-05-05 | Paper |
| Formal Modeling and Analysis of Timed Systems | 2006-11-14 | Paper |
| Oracle semantics for Prolog | 2006-10-10 | Paper |
| Incompleteness of states w.r.t. traces in model checking | 2006-06-09 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Programming Languages and Systems | 2005-09-13 | Paper |
| Computer Science Logic | 2005-08-22 | Paper |
| Transforming semantics by abstract interpretation | 2005-06-30 | Paper |
| Correction to ``Some properties of complete congruence lattices. | 2005-04-19 | Paper |
| Non-standard semantics for program slicing | 2004-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414386 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411978 | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779119 | 2002-11-24 | Paper |
| Some properties of complete congruence lattices | 2000-02-27 | Paper |
| On the least complete extension of complete subsemilattices | 2000-02-27 | Paper |
| Optimal domains for disjunctive abstract interpretation | 2000-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259957 | 1999-09-08 | Paper |
| The reduced relative power operation on abstract domains | 1999-04-28 | Paper |
| Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements | 1999-01-13 | Paper |
| Abductive analysis of modular logic programs | 1999-01-11 | Paper |
| Weak relative pseudo-complements of closure operators | 1998-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217930 | 1998-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5688900 | 1997-05-25 | Paper |
| Generalized semantics and abstract interpretation for constraint logic programs | 1997-04-17 | Paper |
| Modelling Prolog Control | 1994-03-27 | Paper |
| A bottom-up polymorphic type inference in logic programming | 1993-05-16 | Paper |
