33 citations · 206 across the 29 of their papers we have counts for
14 papers · 1 filter
Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
Lorenz Leutgeb, Georg Moser, Florian Zuleger
In this paper, we present the first fully-automated expected amortised cost analysis of self-adjusting data structures, that is, of randomised splay trees, randomised splay heaps a…
Type-Based Analysis of Logarithmic Amortised Complexity
Martin Hofmann, Lorenz Leutgeb, Georg Moser +2
We introduce a novel amortised resource analysis couched in a type-and-effect system. Our analysis is formulated in terms of the physicist's method of amortised analysis, and is po…
Smarter Features, Simpler Learning?
Sarah Winkler, Georg Moser
Earlier work on machine learning for automated reasoning mostly relied on simple, syntactic features combined with sophisticated learning techniques. Using ideas adopted in the sof…
Automated Amortised Resource Analysis for Term Rewrite Systems
Georg Moser, Manuel Schneckenreither
In this paper we establish an automated amortised resource analysis for term rewrite systems. The method is presented in an annotated type system and gives rise to polynomial bound…
Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis
Guillaume Bonfante, Georg Moser
The DICE workshop explores the area of Implicit Computational Complexity (ICC), which grew out from several proposals to use logic and formal methods to provide languages for compl…
Kruskal's Tree Theorem for Acyclic Term Graphs
Georg Moser, Maria A. Schett
In this paper we study termination of term graph rewriting, where we restrict our attention to acyclic term graphs. Motivated by earlier work by Plump we aim at a definition of the…