45 citations · 63 across the 15 of their papers we have counts for
3 papers · 1 filter
Selectively-Amortized Resource Bounding (Extended Version)
Tianhan Lu, Bor-Yuh Evan Chang, Ashutosh Trivedi
We consider the problem of automatically proving resource bounds. That is, we study how to prove that an integer-valued resource variable is bounded by a given program expression.…
Type-directed Bounding of Collections in Reactive Programs
Tianhan Lu, Pavol Cerny, Bor-Yuh Evan Chang +1
Our aim is to statically verify that in a given reactive program, the length of collection variables does not grow beyond a given bound. We propose a scalable type-based technique…
Discriminating Traces with Time
Saeid Tizpaz-Niari, Pavol Cerny, Bor-Yuh Evan Chang +2
What properties about the internals of a program explain the possible differences in its overall running time for different inputs? In this paper, we propose a formal framework for…