| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6197213 | 2024-02-16 | Paper |
| Analysis and Transformation of Constrained Horn Clauses for Program Verification | 2023-12-12 | Paper |
| Supplemental Material: A Classification Study on Testing and Verification of AI-based Systems | 2023-02-20 | Dataset |
| Removing algebraic data types from constrained Horn clauses using difference predicates | 2022-11-09 | Paper |
| Verifying Catamorphism-Based Contracts using Constrained Horn Clauses | 2022-09-30 | Paper |
| Satisfiability of constrained Horn clauses on algebraic data types: A transformation-based approach | 2022-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5020652 | 2022-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3384903 | 2021-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5016384 | 2021-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5015370 | 2021-12-07 | Paper |
| Solving Horn Clauses on Inductive Data Types Without Induction – ERRATUM | 2021-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4997232 | 2021-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994693 | 2021-06-21 | Paper |
| Semantics and Controllability of Time-Aware Business Processes* | 2019-05-24 | Paper |
| Solving Horn Clauses on Inductive Data Types Without Induction | 2018-12-04 | Paper |
| Predicate pairing with abstraction for relational verification | 2018-09-06 | Paper |
| Relational verification through Horn clause transformation | 2018-08-27 | Paper |
| Predicate Pairing for program verification | 2018-05-31 | Paper |
| Program Verification using Constraint Handling Rules and Array Constraint Generalizations* | 2017-11-10 | Paper |
| Proving correctness of imperative programs by linearizing constrained Horn clauses | 2017-11-09 | Paper |
| Verification of time-aware business processes using constrained Horn clauses | 2017-10-13 | Paper |
| A Rule-based Verification Strategy for Array Manipulating Programs | 2016-08-15 | Paper |
| Efficient generation of test data structures using constraint logic programming and program transformation | 2015-12-28 | Paper |
| Verifying Array Programs by Transforming Verification Conditions | 2015-01-13 | Paper |
| Proving theorems by program transformation | 2013-11-28 | Paper |
| Specialization with Constrained Generalization for Software Model Checking | 2013-09-13 | Paper |
| Controlling polyvariance for specialization-based verification | 2013-07-30 | Paper |
| Generalization strategies for the verification of infinite state systems | 2013-06-26 | Paper |
| Constraint-based correctness proofs for logic program transformations | 2013-03-22 | Paper |
| Using Real Relaxations during Program Specialization | 2013-03-13 | Paper |
| Synthesizing Concurrent Programs Using Answer Set Programming | 2013-01-14 | Paper |
| Improving Reachability Analysis of Infinite State Systems by Specialization | 2012-10-29 | Paper |
| Improving Reachability Analysis of Infinite State Systems by Specialization | 2011-10-07 | Paper |
| Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation | 2011-05-27 | Paper |
| Combining Logic Programs and Monadic Second Order Logics by Program Transformation | 2011-03-04 | Paper |
| Transformations of logic programs on infinite lists | 2010-08-19 | Paper |
| The Transformational Approach to Program Development | 2010-07-20 | Paper |
| Deciding Full Branching Time Logic by Program Transformation | 2010-05-04 | Paper |
| A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs | 2010-02-05 | Paper |
| Totally correct logic program transformations via well-founded annotations | 2009-08-04 | Paper |
| Automatic Correctness Proofs for Logic Program Transformations | 2009-03-05 | Paper |
| A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs | 2009-01-22 | Paper |
| Transformational Verification of Parameterized Protocols Using Array Formulas | 2009-01-15 | Paper |
| Proving Properties of Constraint Logic Programs by Eliminating Existential Variables | 2008-03-11 | Paper |
| Derivation of efficient logic programs by specialization and reduction of nondeterminism | 2006-02-08 | Paper |
| Program Development in Computational Logic | 2005-12-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5701513 | 2005-11-03 | Paper |
| Transformations of logic programs with goals as arguments | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808811 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4421875 | 2003-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707742 | 2003-06-11 | Paper |
| The list introduction strategy for the derivation of logic programs | 2002-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767091 | 2002-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723924 | 2001-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499254 | 2001-03-05 | Paper |
| Transformation of logic programs: Foundations and techniques | 2000-08-14 | Paper |
| Synthesis and transformation of logic programs using unfold/fold proofs | 2000-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4391453 | 1998-06-03 | Paper |
| Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4287480 | 1994-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3142026 | 1993-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038669 | 1993-05-18 | Paper |
| The loop absorption and the generalization strategies for the development of logic programs and partial deduction | 1993-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3784070 | 1987-01-01 | Paper |
