9 citations · 14 across the 3 of their papers we have counts for
3 papers
cs.PL2015★ 2 cited
Difference Constraints: An adequate Abstraction for Complexity Analysis of Imperative Programs
Moritz Sinn, Florian Zuleger, Helmut Veith
Difference constraints have been used for termination analysis in the literature, where they denote relational inequalities of the form x' <= y + c, and describe that the value of…
cs.PL2014★ 3 cited
A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis
Moritz Sinn, Florian Zuleger, Helmut Veith
We present the first scalable bound analysis that achieves amortized complexity analysis. In contrast to earlier work, our bound analysis is not based on general purpose reasoners…
cs.PL2012★ 9 cited
Bound Analysis of Imperative Programs with the Size-change Abstraction (extended version)
Florian Zuleger, Sumit Gulwani, Moritz Sinn +1
The size-change abstraction (SCA) is an important program abstraction for termination analysis, which has been successfully implemented in many tools for functional and logic progr…