29 citations · 29 across the 4 of their papers we have counts for
7 papers
General Interpolation and Strong Amalgamation for Contiguous Arrays
Silvio Ghilardi, Alessandro Gianola, Deepak Kapur +1
Interpolation is an essential tool in software verification, where first-order theories are used to constrain datatypes manipulated by programs. In this paper, we introduce the dat…
Interpolation and Amalgamation for Arrays with MaxDiff (Extended Version)
Silvio Ghilardi, Alessandro Gianola, Deepak Kapur
In this paper, the theory of McCarthy's extensional arrays enriched with a maxdiff operation (this operation returns the biggest index where two given arrays differ) is proposed. I…
An Algorithm for Computing a Minimal Comprehensive Gröbner\, Basis of a Parametric Polynomial System
Deepak Kapur, Yiming Yang
An algorithm to generate a minimal comprehensive Gröbner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gröbner\, system is presented. A basis o…
NIL: Learning Nonlinear Interpolants
Mingshuai Chen, Jian Wang, Jie An +3
Nonlinear interpolants have been shown useful for the verification of programs and hybrid systems in contexts of theorem proving, model checking, abstract interpretation, etc. The…
Using Dynamic Analysis to Generate Disjunctive Invariants
ThanhVu Nguyen, Deepak Kapur, Westley Weimer +1
Program invariants are important for defect detection, program verification, and program repair. However, existing techniques have limited support for important classes of invarian…
Connecting Program Synthesis and Reachability: Automatic Program Repair using Test-Input Generation
ThanhVu Nguyen, Westley Weimer, Deepak Kapur +1
We prove that certain formulations of program synthesis and reachability are equivalent. Specifically, our constructive proof shows the reductions between the template-based synthe…