Manuel Meitinger
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Manuel Meitinger has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Georg Moser
University of Innsbruck
2 shared publications - Samuel Frontull
University of Innsbruck
2 shared publications
Latest Publications
- Open Access
- 7 October 2026
- Published by Springer Nature
- p. 530-557
Inferring Empirical Sound Resource Bounds via Symbolic Execution and Linear Programming
- 7 October 2026
- Published by Springer Nature
- p. 530-557
Open AccessInferring Empirical Sound Resource Bounds via Symbolic Execution and Linear Programming
- Open Access
- 15 September 2025
- Published by Springer Nature
- p. 228-246
Data-Driven Runtime Complexity Analysis
We establish a data-driven method for the assessment of the runtime complexity of first-order term rewrite systems (TRSs for short). The fully automated complexity analysis of TRSs has a long tradition in rewriting and numerous sophisticated static analysis methods have been developed. The recent success in machine learning motivates the quest for data-driven analysis techniques, which, while unsound in principle, can potentially return insightful upper bounds on the runtime complexity where traditional (static) techniques fail. We present the first such technique based on bottom-up rule unfolding, akin to a variant of backward narrowing. Further, we employ a dedicated notion of data fitting that is fine-tuned to the estimation of asymptotic complexities. We provide ample experimental data indicating the viability of the approach.
- 15 September 2025
- Published by Springer Nature
- p. 228-246
Open AccessData-Driven Runtime Complexity Analysis
We establish a data-driven method for the assessment of the runtime complexity of first-order term rewrite systems (TRSs for short). The fully automated complexity analysis of TRSs has a long tradition in rewriting and numerous sophisticated static analysis methods have been developed. The recent success in machine learning motivates the quest for data-driven analysis techniques, which, while unsound in principle, can potentially return insightful upper bounds on the runtime complexity where traditional (static) techniques fail. We present the first such technique based on bottom-up rule unfolding, akin to a variant of backward narrowing. Further, we employ a dedicated notion of data fitting that is fine-tuned to the estimation of asymptotic complexities. We provide ample experimental data indicating the viability of the approach.