2 citations · 3 across the 12 of their papers we have counts for
5 papers · 1 filter
Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi +3
The problem of checking satisfiability of linear real arithmetic (LRA) and non-linear real arithmetic (NRA) formulas has broad applications, in particular, they are at the heart of…
PolyQEnt: A Polynomial Quantified Entailment Solver
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady +4
Polynomial quantified entailments with existentially and universally quantified variables arise in many problems of verification and program analysis. We present PolyQEnt which is…
Bidding Games with Charging
Guy Avni, Ehsan Kafshdar Goharshady, Thomas A. Henzinger +1
Graph games lie at the algorithmic core of many automated design problems in computer science. These are games usually played between two players on a given graph, where the player…
Equivalence and Similarity Refutation for Probabilistic Programs
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný +1
We consider the problems of statically refuting equivalence and similarity of output distributions defined by a pair of probabilistic programs. Equivalence and similarity are two f…
Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady +2
We study the classical problem of verifying programs with respect to formal specifications given in the linear temporal logic (LTL). We first present novel sound and complete witne…