| Publication | Date of Publication | Type |
|---|
| Typable fragments of polynomial automatic amortized resource analysis | 2026-03-23 | Paper |
| Automatic amortized resource analysis with regular recursive types | 2026-02-27 | Paper |
Worst-case input generation for concurrent programs under non-monotone resource metrics
Logical Methods in Computer Science | 2025-01-31 | Paper |
Two decades of automatic amortized resource analysis
Mathematical Structures in Computer Science | 2023-02-06 | Paper |
| Automated resource analysis with Coq proof objects | 2022-08-12 | Paper |
Work analysis with resource-aware session types
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Exponential automatic amortized resource analysis
(available as arXiv preprint) | 2020-09-23 | Paper |
| scientific article; zbMATH DE number 7204445 (Why is no real title available?) | 2020-05-26 | Paper |
Automatic Space Bound Analysis for Functional Programs with Garbage Collection
EPiC Series in Computing | 2019-07-04 | Paper |
Type-based amortized resource analysis with integers and arrays
Journal of Functional Programming | 2017-10-23 | Paper |
Relational cost analysis
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages | 2017-10-20 | Paper |
Towards automatic resource bound analysis for OCaml
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages | 2017-10-20 | Paper |
Quantitative reasoning for proving lock-freedom
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Automatic Static Cost Analysis for Parallel Programs
Programming Languages and Systems | 2016-04-26 | Paper |
Higher-order functional reactive programming in bounded space
Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-09-11 | Paper |
Type-based amortized resource analysis with integers and arrays
Functional and Logic Programming | 2014-07-24 | Paper |
Multivariate amortized resource analysis
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-04-10 | Paper |
Tracking data-flow with open closure types
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
The complexity of computing minimal unidirectional covering sets
Theory of Computing Systems | 2013-10-21 | Paper |
Characterizing progress properties of concurrent objects via contextual refinements
CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
The computational complexity of weak saddles
Theory of Computing Systems | 2011-11-23 | Paper |
The complexity of computing minimal unidirectional covering sets
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs
Programming Languages and Systems | 2010-05-04 | Paper |
The computational complexity of weak saddles
Algorithmic Game Theory | 2009-12-01 | Paper |
Finding a tree structure in a resolution proof is NP-complete
Theoretical Computer Science | 2009-05-28 | Paper |
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning
Logical Methods in Computer Science | 2009-04-29 | Paper |
| scientific article; zbMATH DE number 5485261 (Why is no real title available?) | 2008-12-30 | Paper |
The NP-hardness of finding a directed acyclic graph for regular resolution
Theoretical Computer Science | 2008-05-28 | Paper |
| scientific article; zbMATH DE number 5035860 (Why is no real title available?) | 2006-06-26 | Paper |
| scientific article; zbMATH DE number 2185587 (Why is no real title available?) | 2005-07-04 | Paper |
