| Publication | Date of Publication | Type |
|---|
| Termination analysis of programs with multiphase control-flow | 2024-12-03 | Paper |
| Multiphase-linear ranking functions and their relation to recurrent sets | 2024-04-19 | Paper |
| On multiphase-linear ranking functions | 2022-08-12 | Paper |
| May-Happen-in-Parallel Analysis with Returned Futures | 2022-08-12 | Paper |
| Lower-bound synthesis using loop specialization and Max-SMT | 2022-03-25 | Paper |
| A Transformational Approach to Resource Analysis with Typed-norms Inference | 2021-09-03 | Paper |
| Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis | 2020-05-04 | Paper |
| May-happen-in-parallel analysis with condition synchronization | 2018-10-25 | Paper |
| Complexity of Bradley-Manna-Sipma lexicographic ranking functions | 2018-03-01 | Paper |
| Rely-guarantee termination and cost analyses of loops with concurrent interleavings | 2017-08-15 | Paper |
| May-Happen-in-Parallel Analysis for Actor-Based Concurrency | 2017-07-12 | Paper |
| Inferring non-suspension conditions for logic programs with dynamic scheduling | 2017-07-12 | Paper |
| A Transformational Approach to Resource Analysis with Typed-Norms | 2015-11-30 | Paper |
| On the Inference of Resource Usage Upper and Lower Bounds | 2015-09-17 | Paper |
| Inference of Field-Sensitive Reachability and Cyclicity | 2015-09-17 | Paper |
| Ranking Functions for Linear-Constraint Loops | 2015-08-14 | Paper |
| On the linear ranking problem for integer linear-constraint loops | 2014-11-27 | Paper |
| Corrigendum to ``Reachability-based acyclicity analysis by abstract interpretation | 2014-09-02 | Paper |
| Termination and Cost Analysis of Loops with Concurrent Interleavings | 2014-07-08 | Paper |
| Precise Cost Analysis via Local Reasoning | 2014-07-08 | Paper |
| May-Happen-in-Parallel Analysis for Priority-Based Scheduling | 2014-01-17 | Paper |
| Reachability-based acyclicity analysis by abstract interpretation | 2013-03-27 | Paper |
| On the Termination of Integer Loops | 2012-06-15 | Paper |
| Automatic Inference of Resource Consumption Bounds | 2012-06-15 | Paper |
| Cost analysis of object-oriented bytecode programs | 2012-03-13 | Paper |
| Inferring Termination Conditions for Logic Programs Using Backwards Analysis | 2011-05-06 | Paper |
| Closed-form upper bounds in static cost analysis | 2011-04-05 | Paper |
| More Precise Yet Widely Applicable Cost Analysis | 2011-02-15 | Paper |
| From Object Fields to Local Variables: A Practical Approach to Field-Sensitive Analysis | 2010-10-01 | Paper |
| Comparing Cost Functions in Resource Analysis | 2010-09-14 | Paper |
| Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis | 2008-08-28 | Paper |
| Detecting Determinacy in Prolog Programs | 2008-03-11 | Paper |
| Verification, Model Checking, and Abstract Interpretation | 2005-12-06 | Paper |
| Inferring termination conditions for logic programs using backwards analysis | 2005-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736992 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736509 | 2004-08-09 | Paper |
| Worst-case groundness analysis using definite Boolean functions | 2004-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417885 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411979 | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2763688 | 2002-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495072 | 2000-08-10 | Paper |
