5 citations · 6 across the 3 of their papers we have counts for
5 papers
Relational Network Verification
Xieyang Xu, Yifei Yuan, Zachary Kincaid +4
Relational network verification is a new approach to validating network changes. In contrast to traditional network verification, which analyzes specifications for a single network…
Optimal Symbolic Bound Synthesis
John Cyphert, Yotam Feldman, Zachary Kincaid +1
The problem of finding a constant bound on a term given a set of assumptions has wide applications in optimization as well as program analysis. However, in many contexts the object…
A Symbolic Decision Procedure for Symbolic Alternating Finite Automata
Loris D'Antoni, Zachary Kincaid, Fang Wang
We introduce Symbolic Alternating Finite Automata (s-AFA) as an expressive, succinct, and decidable model for describing sets of finite sequences over arbitrary alphabets. Boolean…
Compositional Invariant Generation via Linear Recurrence Analysis
Azadeh Farzan, Zachary Kincaid
This paper presents a new method for automatically generating numerical invariants for imperative programs. Given a program, our procedure computes a binary input/output relation o…
Spatial Interpolants
Aws Albarghouthi, Josh Berdine, Byron Cook +1
We propose Splinter, a new technique for proving properties of heap-manipulating programs that marries (1) a new separation logic-based analysis for heap reasoning with (2) an inte…