Sava Krstic
Intel
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Sava Krstic.
frontiers of combining systems | 2007
Sava Krstic; Amit Goel
We offer a transition system representing a high-level but detailed architecture for SMT solvers that combine a propositional SAT engine with solvers for multiple disjoint theories. The system captures succintly and accurately all the major aspects of the solvers global operation: boolean search with across-the-board backjumping, communication of theory-specific facts and equalities between shared variables, and cooperative conflict analysis. Provably correct and prudently underspecified, our system is a usable ground for high-quality implementations of comprehensive SMT solvers.
tools and algorithms for construction and analysis of systems | 2009
Alexander Fuchs; Amit Goel; Jim Grundy; Sava Krstic; Cesare Tinelli
Given a theory
formal methods in computer-aided design | 2006
Sava Krstic; Jordi Cortadella; Michael Kishinevsky; John W. O'Leary
\mathcal{T}
computer aided verification | 2012
Sylvain Conchon; Amit Goel; Sava Krstic; Alain Mebsout; Fatiha Zaïdi
and two formulas A and B jointly unsatisfiable in
conference on automated deduction | 2013
Andrew Reynolds; Cesare Tinelli; Amit Goel; Sava Krstic; Morgan Deters; Clark Barrett
\mathcal{T}
conference on automated deduction | 2005
Sava Krstic; Sylvain Conchon
, a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by A and B , (ii) it is entailed by A in
formal methods in computer-aided design | 2013
Sylvain Conchon; Amit Goel; Sava Krstic; Alain Mebsout; Fatiha Zaïdi
\mathcal{T}
verification model checking and abstract interpretation | 2002
Sava Krstic; John Matthews
, and (iii) it is unsatisfiable with B in
hardware-oriented security and trust | 2014
Sava Krstic; Jin Yang; David W. Palmer; Randy B. Osborne; Eran Talmor
\mathcal{T}
theorem proving in higher order logics | 2003
Sava Krstic; John Matthews
. Theory interpolants are used in model checking to accelerate the computation of reachability relations. We present a novel method for computing ground interpolants for ground formulas in the theory of equality. Our algorithm computes interpolants from colored congruence graphs representing derivations in the theory of equality. These graphs can be produced by conventional congruence closure algorithms in a straightforward manner. By working with graphs, rather than at the level of individual proof steps, we are able to derive interpolants that are pleasingly simple (conjunctions of Horn clauses) and smaller than those generated by other tools.
