| Publication | Date of Publication | Type |
|---|
| Decidable entailments in separation logic with inductive definitions: beyond establishment | 2026-03-23 | Paper |
Characterizations of monadic second order definable context-free sets of graphs
Logical Methods in Computer Science | 2026-03-23 | Paper |
| Expressiveness results for an inductive logic of separated relations | 2025-06-26 | Paper |
| Entailment checking in separation logic with inductive definitions is 2-ExpTime hard | 2025-02-20 | Paper |
| Tree-verifiable graph grammars | 2025-02-19 | Paper |
| On an invariance problem for parameterized concurrent systems | 2024-08-13 | Paper |
Alternating automata modulo first order theories
Computer Aided Verification | 2024-02-16 | Paper |
Checking deadlock-freedom of parametric component-based systems
Tools and Algorithms for the Construction and Analysis of Systems | 2023-11-24 | Paper |
Verification of component-based systems with recursive architectures
Theoretical Computer Science | 2023-04-20 | Paper |
Program Verification with Separation Logic
Model Checking Software | 2023-03-21 | Paper |
Decision problems in a logic for reasoning about reconfigurable distributed systems
(available as arXiv preprint) | 2022-12-07 | Paper |
Structural Invariants for the Verification of Systems with Parameterized Architectures
Tools and Algorithms for the Construction and Analysis of Systems | 2022-10-13 | Paper |
Unifying decidable entailments in separation logic with inductive definitions
(available as arXiv preprint) | 2021-12-01 | Paper |
Entailment is undecidable for symbolic heap separation logic formulæ with non-established inductive rules
Information Processing Letters | 2021-10-19 | Paper |
Checking deadlock-freedom of parametric component-based systems
Journal of Logical and Algebraic Methods in Programming | 2021-02-26 | Paper |
Abstraction refinement and antichains for trace inclusion of infinite state systems
Formal Methods in System Design | 2021-02-08 | Paper |
The Bernays-Schönfinkel-Ramsey class of separation logic with uninterpreted predicates
ACM Transactions on Computational Logic | 2020-09-11 | Paper |
| Prenex separation logic with one selector field | 2020-05-14 | Paper |
| The Bernays-Schönfinkel-Ramsey class of separation logic on arbitrary domains | 2020-01-28 | Paper |
Abstraction refinement and antichains for trace inclusion of infinite state systems
Tools and Algorithms for the Construction and Analysis of Systems | 2019-09-17 | Paper |
| Abstraction refinement for emptiness checking of alternating data automata | 2019-09-16 | Paper |
A complete cyclic proof system for inductive entailments in first order logic
EPiC Series in Computing | 2019-07-04 | Paper |
A decision procedure for separation logic in SMT
(available as arXiv preprint) | 2018-10-25 | Paper |
How hard is it to verify flat affine counter systems with the finite monoid property?
(available as arXiv preprint) | 2018-10-25 | Paper |
| Automata-based termination proofs | 2018-04-05 | Paper |
Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Deciding entailments in inductive separation logic with tree automata
Automated Technology for Verification and Analysis | 2015-12-17 | Paper |
Interprocedural reachability for flat integer programs
Fundamentals of Computation Theory | 2015-09-29 | Paper |
Safety problems are NP-complete for flat integer programs with octagonal loops
Lecture Notes in Computer Science | 2015-01-13 | Paper |
Deciding conditional termination
Logical Methods in Computer Science | 2014-09-05 | Paper |
| Space-reduction strategies for model checking dynamic software | 2013-08-30 | Paper |
Underapproximation of procedure summaries for integer programs
Tools and Algorithms for the Construction and Analysis of Systems | 2013-08-05 | Paper |
The tree width of separation logic with recursive definitions
Automated Deduction – CADE-24 | 2013-06-14 | Paper |
Accelerating interpolants
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
Deciding conditional termination
Tools and Algorithms for the Construction and Analysis of Systems | 2012-06-29 | Paper |
Programs with lists are counter automata
Formal Methods in System Design | 2011-05-23 | Paper |
Quantitative separation logic and programs with lists
Journal of Automated Reasoning | 2010-10-08 | Paper |
Fast acceleration of ultimately periodic relations
Computer Aided Verification | 2010-08-18 | Paper |
Automata-based verification of programs with tree updates
Acta Informatica | 2010-02-05 | Paper |
Automata-Based Termination Proofs
Implementation and Application of Automata | 2009-07-09 | Paper |
Automatic Verification of Integer Array Programs
Computer Aided Verification | 2009-06-30 | Paper |
Flat Parametric Counter Automata
Fundamenta Informaticae | 2009-06-23 | Paper |
Iterating Octagons
Tools and Algorithms for the Construction and Analysis of Systems | 2009-03-31 | Paper |
A Logic of Singly Indexed Arrays
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Quantitative Separation Logic and Programs with Lists
Automated Reasoning | 2008-11-27 | Paper |
Proving Termination of Tree Manipulating Programs
Automated Technology for Verification and Analysis | 2008-07-03 | Paper |
What Else Is Decidable about Integer Arrays?
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
On Flat Programs with Lists
Lecture Notes in Computer Science | 2008-04-04 | Paper |
Flat Parametric Counter Automata
Automata, Languages and Programming | 2007-09-11 | Paper |
Programs with Lists Are Counter Automata
Computer Aided Verification | 2007-09-05 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Translating Java for multiple model checkers: The Bandera back-end
Formal Methods in System Design | 2006-02-20 | Paper |
Foundations of Software Science and Computational Structures
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Static Analysis
Lecture Notes in Computer Science | 2005-08-24 | Paper |
| scientific article; zbMATH DE number 2087620 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1670550 (Why is no real title available?) | 2001-11-11 | Paper |
