Michael Schaper

According to our database, Michael Schaper authored at least 6 papers between 2012 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

A modular cost analysis for probabilistic programs.

Martin Avanzini, Georg Moser, Michael Schaper

Proc. ACM Program. Lang., 2020

2019

Modular Runtime Complexity Analysis of Probabilistic While Programs.

Martin Avanzini, Michael Schaper, Georg Moser

CoRR, 2019

2018

From Jinja bytecode to term rewriting: A complexity reflecting transformation.

Georg Moser, Michael Schaper

Inf. Comput., 2018

2017

GUBS Upper Bound Solver (Extended Abstract).

Martin Avanzini, Michael Schaper

Proceedings of the Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, 2017

2016

TcT: Tyrolean Complexity Tool.

Martin Avanzini, Georg Moser, Michael Schaper

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

2012

A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems

Georg Moser, Michael Schaper

CoRR, 2012