24 citations · 63 across the 13 of their papers we have counts for
14 papers
Uncovering the Limits of Proof Sharing for Neural Networks
Kanak Das, Shubham Ugare, Bor-Yuh Evan Chang +3
Robustness verification of neural networks is increasingly important, due to their use in many critical domains. In certain scenarios, proof sharing has been shown to accelerate in…
Differential Cost Analysis with Simultaneous Potentials and Anti-potentials
Đorđe Žikelić, Bor-Yuh Evan Chang, Pauline Bolignano +1
We present a novel approach to differential cost analysis that, given a program revision, attempts to statically bound the difference in resource usage, or cost, between the two pr…
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.…
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…
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…
Safe Stream-Based Programming with Refinement Types
Benno Stein, Lazaro Clapp, Manu Sridharan +1
In stream-based programming, data sources are abstracted as a stream of values that can be manipulated via callback functions. Stream-based programming is exploding in popularity,…