19 citations · 32 across the 6 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.PL2021
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.…
cs.PL2021★ 19 cited
Demanded Abstract Interpretation (Extended Version)
Benno Stein, Bor-Yuh Evan Chang, Manu Sridharan
We consider the problem of making expressive static analyzers interactive. Formal static analysis is seeing increasingly widespread adoption as a tool for verification and bug-find…