activity
20052026
most citedThe Epsilon Calculus and Herbrand Complexity

33 citations · 206 across the 29 of their papers we have counts for

collaborators

30 papers

cs.PL2026

Automated Amortised Analysis of Skew Heaps and Leftist Heaps (Extended Version)

Armin Walch, Georg Moser, Berry Schoenmakers +1

We study the fully automated amortised analysis of purely functional data structures like skew heaps, as well as weight- and rank-biased leftist heaps. For that we generalise earli…

cs.PL2026

Automated Expected Cost Analysis for Quantum Programs

Georg Moser, Michael Schaper

In recent years, quantum computing has gained a substantial amount of momentum, and the capabilities of quantum devices are continually expanding and improving. Nevertheless, writi…

cs.PL2023

Automated Expected Value Analysis of Recursive Programs

Martin Avanzini, Georg Moser, Michael Schaper

In this work, we study the fully automated inference of expected result values of probabilistic programs in the presence of natural programming constructs such as procedures, local…

cs.LG2022★ 2 cited

Rule Learning by Modularity

Albert Nössig, Tobias Hell, Georg Moser

In this paper, we present a modular methodology that combines state-of-the-art methods in (stochastic) machine learning with traditional methods in rule learning to provide efficie…

cs.LO2022★ 18 cited

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…

quant-ph2022★ 10 cited

Quantum Expectation Transformers for Cost Analysis

Martin Avanzini, Georg Moser, Romain Péchoux +2

We introduce a new kind of expectation transformer for a mixed classical-quantum programming language. Our semantic approach relies on a new notion of a cost structure, which we in…