research
∙
04/03/2023
Automated Expected Value Analysis of Recursive Programs
In this work, we study the fully automated inference of expected result ...
share
research
∙
12/23/2022
Rule Learning by Modularity
In this paper, we present a modular methodology that combines state-of-t...
research
∙
06/07/2022
Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
In this paper, we present the first fully-automated expected amortised c...
research
∙
01/23/2022
Quantum Expectation Transformers for Cost Analysis
We introduce a new kind of expectation transformer for a mixed classical...
research
∙
01/28/2021
Type-Based Analysis of Logarithmic Amortised Complexity
We introduce a novel amortised resource analysis couched in a type-and-e...
research
∙
12/11/2020
Runtime Complexity Analysis of Logically Constrained Rewriting
Logically constrained rewrite systems (LCTRSs) are a versatile and effic...
research
∙
11/15/2019
Smarter Features, Simpler Learning?
Earlier work on machine learning for automated reasoning mostly relied o...
research
∙
08/23/2019
Modular Runtime Complexity Analysis of Probabilistic While Programs
We are concerned with the average case runtime complexity analysis of a ...
research
∙
04/25/2019
The Epsilon Calculus with Equality and Herbrand Complexity
Hilbert's epsilon calculus is an extension of elementary or predicate ca...
research
∙
11/22/2018
Automated Amortised Resource Analysis for Term Rewrite Systems
In this paper we establish an automated amortised resource analysis for ...
research
∙
07/22/2018
Analysis of Logarithmic Amortised Complexity
We introduce a novel amortised resource analysis based on a potential-ba...
research
∙
02/15/2011
Automated Complexity Analysis Based on the Dependency Pair Method
This article is concerned with automated complexity analysis of term rew...
research
∙
04/06/2009
Dependency Pairs and Polynomial Path Orders
We show how polynomial path orders can be employed efficiently in conjun...
research
∙
04/03/2009