Sciweavers

928 search results - page 47 / 186
» Interpolation-sequence based model checking
Sort
View
DATE
2007
IEEE
97views Hardware» more  DATE 2007»
15 years 4 months ago
Estimating functional coverage in bounded model checking
Formal verification is an important issue in circuit and system design. In this context, Bounded Model Checking (BMC) is one of the most successful techniques. But even if all sp...
Daniel Große, Ulrich Kühne, Rolf Drechs...
TACAS
2004
Springer
110views Algorithms» more  TACAS 2004»
15 years 3 months ago
An Interpolating Theorem Prover
We present a method of deriving Craig interpolants from proofs in the quantifier-free theory of linear inequality and uninterpreted function symbols, and an interpolating theorem...
Kenneth L. McMillan
CAV
2004
Springer
202views Hardware» more  CAV 2004»
15 years 3 months ago
Statistical Model Checking of Black-Box Probabilistic Systems
Abstract. We propose a new statistical approach to analyzing stochastic systems against specifications given in a sublogic of continuous stochastic logic (CSL). Unlike past numeri...
Koushik Sen, Mahesh Viswanathan, Gul Agha
FMSD
2006
140views more  FMSD 2006»
14 years 10 months ago
Dealing with practical limitations of distributed timed model checking for timed automata
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
Víctor A. Braberman, Alfredo Olivero, Ferna...
FMCAD
2004
Springer
15 years 3 months ago
Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
Mohammad Awedh, Fabio Somenzi