Sciweavers

332 search results - page 3 / 67
» Model Checking Using SMT and Theory of Lists
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 3 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise
CADE
2010
Springer
13 years 6 months ago
MCMT: A Model Checker Modulo Theories
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
Silvio Ghilardi, Silvio Ranise
ICMLC
2010
Springer
13 years 2 months ago
An improvement of translation quality with adding key-words in parallel corpus
: In this paper, we propose a new approach to improve the translation quality by adding the Key-Words of a sentence to the parallel corpus. The main idea of the approach is to find...
Liang Tian, Fai Wong, Sam Chao
CADE
2009
Springer
13 years 11 months ago
Interpolant Generation for UTVPI
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
Alessandro Cimatti, Alberto Griggio, Roberto Sebas...
CAV
2009
Springer
182views Hardware» more  CAV 2009»
13 years 11 months ago
Generalizing DPLL to Richer Logics
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
Kenneth L. McMillan, Andreas Kuehlmann, Mooly Sagi...