Sciweavers

33 search results - page 1 / 7
» Probabilistic Model Checking Modulo Theories
Sort
View
QEST
2007
IEEE
13 years 10 months ago
Probabilistic Model Checking Modulo Theories
— Probabilistic models are widely used to analyze embedded, networked, and more recently biological systems. Existing numerical analysis techniques are limited to finitestate mo...
Björn Wachter, Lijun Zhang, Holger Hermanns
TABLEAUX
2009
Springer
13 years 10 months ago
Goal-Directed Invariant Synthesis for Model Checking Modulo Theories
We are interested in automatically proving safety properties of infinite state systems. We present a technique for invariant synthesis which can be incorporated in backward reacha...
Silvio Ghilardi, Silvio Ranise
CADE
2010
Springer
13 years 4 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
CAV
2009
Springer
163views Hardware» more  CAV 2009»
14 years 4 months ago
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas...
Leonardo Mendonça de Moura, Yeting Ge
CADE
2008
Springer
14 years 3 months ago
Towards SMT Model Checking of Array-Based Systems
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...