2024
Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT
Automated Reasoning - 12th International Joint Conference, IJCAR 2024, Nancy, France
Lecture Notes in Computer Science 14739, 233–243, 2024
DOI ArXiv PDF Website
2023
Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
Frontiers of Combining Systems - 14th International Symposium, FroCoS 2023, Prague, Czech Republic
Lecture Notes in Computer Science 14279, 3–22, 2023
DOI ArXiv PDF Website
2022
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
Automated Reasoning - 11th International Joint Conference, IJCAR 2022, Haifa, Israel
Lecture Notes in Computer Science 13385, 734–754, 2022
DOI ArXiv PDF Website
Improving Automatic Complexity Analysis of Integer Programs
The Logic of Software: A Tasting Menu of Formal Methods
Lecture Notes in Computer Science 13360, 193–228, 2022
DOI ArXiv PDF Website
2021
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
Tools and Algorithms for the Construction and Analysis of Systems - 27th International Conference, TACAS 2021, Luxembourg
Lecture Notes in Computer Science 12651, 250–269, 2021
DOI ArXiv PDF Website
2016
Analyzing Runtime and Size Complexity of Integer Programs
ACM Trans. Program. Lang. Syst. 38, 13:1–13:50, 2016
DOI PDF