| 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
(available as arXiv preprint) | 2022-08-12 | Paper |
May-Happen-in-Parallel Analysis with Returned Futures
Automated Technology for Verification and Analysis | 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
Theory and Practice of Logic Programming | 2021-09-03 | Paper |
Control-flow refinement by partial evaluation, and its application to termination and cost analysis
Theory and Practice of Logic Programming | 2020-05-04 | Paper |
| May-happen-in-parallel analysis with condition synchronization | 2018-10-25 | Paper |
Complexity of Bradley-Manna-Sipma lexicographic ranking functions
(available as arXiv preprint) | 2018-03-01 | Paper |
Rely-guarantee termination and cost analyses of loops with concurrent interleavings
Journal of Automated Reasoning | 2017-08-15 | Paper |
May-happen-in-parallel analysis for actor-based concurrency
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Inferring non-suspension conditions for logic programs with dynamic scheduling
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
A transformational approach to resource analysis with typed-norms
Logic-Based Program Synthesis and Transformation | 2015-11-30 | Paper |
A transformational approach to resource analysis with typed-norms
Logic-Based Program Synthesis and Transformation | 2015-11-30 | Paper |
On the inference of resource usage upper and lower bounds
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Inference of field-sensitive reachability and cyclicity
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Ranking functions for linear-constraint loops
Journal of the ACM | 2015-08-14 | Paper |
On the \textsc{Linear Ranking} problem for integer linear-constraint loops
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-11-27 | Paper |
Corrigendum to ``Reachability-based acyclicity analysis by abstract interpretation''
Theoretical Computer Science | 2014-09-02 | Paper |
Termination and cost analysis of loops with concurrent interleavings
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
Precise cost analysis via local reasoning
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
May-Happen-in-Parallel Analysis for Priority-Based Scheduling
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
Reachability-based acyclicity analysis by abstract interpretation
Theoretical Computer Science | 2013-03-27 | Paper |
On the termination of integer loops
Lecture Notes in Computer Science | 2012-06-15 | Paper |
Automatic inference of resource consumption bounds
Logic for Programming, Artificial Intelligence, and Reasoning | 2012-06-15 | Paper |
Cost analysis of object-oriented bytecode programs
Theoretical Computer Science | 2012-03-13 | Paper |
Inferring termination conditions for logic programs using backwards analysis
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-05-06 | Paper |
Closed-form upper bounds in static cost analysis
Journal of Automated Reasoning | 2011-04-05 | Paper |
More precise yet widely applicable cost analysis
Lecture Notes in Computer Science | 2011-02-15 | Paper |
From object fields to local variables: a practical approach to field-sensitive analysis
Static Analysis | 2010-10-01 | Paper |
Comparing cost functions in resource analysis
Foundational and Practical Aspects of Resource Analysis | 2010-09-14 | Paper |
Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
Static Analysis | 2008-08-28 | Paper |
Detecting Determinacy in Prolog Programs
Logic Programming | 2008-03-11 | Paper |
Verification, Model Checking, and Abstract Interpretation
Lecture Notes in Computer Science | 2005-12-06 | Paper |
Inferring termination conditions for logic programs using backwards analysis
Theory and Practice of Logic Programming | 2005-04-29 | Paper |
| scientific article; zbMATH DE number 2086511 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2085274 (Why is no real title available?) | 2004-08-09 | Paper |
Worst-case groundness analysis using definite Boolean functions
Theory and Practice of Logic Programming | 2004-03-01 | Paper |
| scientific article; zbMATH DE number 1956547 (Why is no real title available?) | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1948414 (Why is no real title available?) | 2003-07-13 | Paper |
| scientific article; zbMATH DE number 1692955 (Why is no real title available?) | 2002-01-21 | Paper |
| scientific article; zbMATH DE number 1487945 (Why is no real title available?) | 2000-08-10 | Paper |
