Sciweavers

394 search results - page 2 / 79
» An Abstract Domain of Uninterpreted Functions
Sort
View
ESOP
2008
Springer
13 years 6 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
SPIN
2012
Springer
11 years 7 months ago
SMTInterpol: An Interpolating SMT Solver
Abstract. Craig interpolation is an active research topic and has become a powerful technique in verification. We present SMTInterpol, an interpolating SMT solver for the quanti...
Jürgen Christ, Jochen Hoenicke, Alexander Nut...
APLAS
2011
ACM
12 years 4 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
CAV
1998
Springer
138views Hardware» more  CAV 1998»
13 years 9 months ago
Model Checking for a First-Order Temporal Logic Using Multiway Decision Graphs
bstract description of state machines (ASMs), in which data and data operations are d using abstract sort and uninterpreted function symbols. ASMs are suitable for describing Regis...
Ying Xu, Eduard Cerny, Xiaoyu Song, Francisco Core...
ESOP
2007
Springer
13 years 11 months ago
Computing Procedure Summaries for Interprocedural Analysis
Abstract. We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a bac...
Sumit Gulwani, Ashish Tiwari