| Publication | Date of Publication | Type |
|---|
Adjointness in property directed reachability analysis
Formal Methods in System Design | 2026-08-13 | Paper |
Broadening the applicability of local completeness analysis with intensional and extensional guarantees
Theoretical Computer Science | 2025-10-17 | Paper |
A correctness and incorrectness program logic
Journal of the ACM | 2025-02-05 | Paper |
Limits and difficulties in the design of under-approximation abstract domains
Lecture Notes in Computer Science | 2024-01-23 | Paper |
| Exploiting adjoints in property directed reachability analysis | 2024-01-12 | Paper |
| Logics for extensional, locally complete analysis via domain refinements | 2023-11-24 | Paper |
Computing preimages and ancestors in reaction systems
Theory and Practice of Natural Computing | 2023-10-16 | Paper |
Deciding program properties via complete abstractions on bounded domains
Static Analysis | 2023-07-28 | Paper |
| Exploiting Modularity of SOS Semantics to Define Quantitative Extensions of Reaction Systems | 2023-04-13 | Paper |
Characterization and computation of ancestors in reaction systems
Soft Computing | 2022-07-21 | Paper |
Correct approximation of IEEE 754 floating-point arithmetic for program verification
Constraints | 2022-07-07 | Paper |
Encoding threshold Boolean networks into reaction systems for the analysis of gene regulatory networks
Fundamenta Informaticae | 2021-11-15 | Paper |
A survey of gene regulatory networks modelling methods: from differential equations, to Boolean and qualitative bioinspired models
Journal of Membrane Computing | 2021-09-14 | Paper |
Encoding Boolean networks into reaction systems for investigating causal dependencies in gene regulation
Theoretical Computer Science | 2021-08-11 | Paper |
Code obfuscation against abstract model checking attacks
Lecture Notes in Computer Science | 2020-07-07 | Paper |
Studying opacity of reaction systems through formula based predictors
Fundamenta Informaticae | 2019-05-24 | Paper |
Code obfuscation against abstraction refinement attacks
Formal Aspects of Computing | 2018-11-16 | Paper |
Predictors for flat membrane systems
Theoretical Computer Science | 2018-06-18 | Paper |
| Multiset patterns and their application to dynamic causalities in membrane systems | 2018-05-16 | Paper |
Generalized contexts for reaction systems: definition and study of dynamic causalities
Acta Informatica | 2018-04-17 | Paper |
Specialized predictor for reaction systems with context properties
Fundamenta Informaticae | 2017-11-09 | Paper |
A hierarchy of semantics for normal constraint logic programs
Algebraic and Logic Programming | 2017-01-19 | Paper |
Exploiting binary floating-point representations for constraint propagation
INFORMS Journal on Computing | 2016-05-19 | Paper |
| An analysis for causal properties of membrane interactions | 2016-04-26 | Paper |
Investigating dynamic causalities in reaction systems
Theoretical Computer Science | 2016-03-31 | Paper |
A Global Occurrence Counting Analysis for Brane Calculi
Logic-Based Program Synthesis and Transformation | 2016-02-05 | Paper |
Causal static analysis for brane calculi
Theoretical Computer Science | 2015-06-10 | Paper |
Approximating probabilistic behaviors of biological systems using abstract interpretation
Electronic Notes in Theoretical Computer Science | 2014-03-21 | Paper |
Assertion based inductive verification methods for logic programs
Electronic Notes in Theoretical Computer Science | 2013-06-06 | Paper |
Logic programs as specifications in the inductive verification of logic programs
Electronic Notes in Theoretical Computer Science | 2013-05-24 | Paper |
An analysis for proving probabilistic termination of biological systems
Theoretical Computer Science | 2013-02-19 | Paper |
Boolean functions for finite-tree dependencies
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-05-06 | Paper |
How to transform an analyzer into a verifier
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-05-06 | Paper |
Abstract interpretation based verification of temporal properties for BioAmbients
Information and Computation | 2010-08-19 | Paper |
An Analysis for Proving Temporal Properties of Biological Systems
Programming Languages and Systems | 2008-05-06 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Finite-tree analysis for constraint logic-based languages
Information and Computation | 2006-03-07 | Paper |
On the verification of finite failure
Journal of Computer and System Sciences | 2005-12-07 | Paper |
Abstract interpretation based verification of logic programs
Science of Computer Programming | 2004-11-23 | Paper |
| scientific article; zbMATH DE number 2086518 (Why is no real title available?) | 2004-08-11 | Paper |
Enhancing the expressive power of the U-Datalog language
Theory and Practice of Logic Programming | 2004-03-01 | Paper |
| scientific article; zbMATH DE number 1953027 (Why is no real title available?) | 2003-07-25 | Paper |
An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1846743 (Why is no real title available?) | 2002-12-17 | Paper |
| scientific article; zbMATH DE number 1832223 (Why is no real title available?) | 2002-11-19 | Paper |
| scientific article; zbMATH DE number 1696776 (Why is no real title available?) | 2002-07-22 | Paper |
| scientific article; zbMATH DE number 1497823 (Why is no real title available?) | 2001-03-05 | Paper |
| scientific article; zbMATH DE number 1405454 (Why is no real title available?) | 2000-12-12 | Paper |
| scientific article; zbMATH DE number 1487845 (Why is no real title available?) | 2000-08-10 | Paper |
Finite failure is and-compositional
Journal Of Logic And Computation | 1998-03-25 | Paper |
