3 papers
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.GT2021
Approximate Core Allocations for Multiple Partners Matching Games
Han Xiao, Tianhang Lu, Qizhi Fang
The matching game is a cooperative game where the value of every coalition is the maximum revenue of players in the coalition can make by forming pairwise disjoint partners. The mu…
cs.PL2018
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…