Sciweavers

33 search results - page 2 / 7
» Improved Algorithms for the Automata-Based Approach to Model...
Sort
View
DAC
2006
ACM
14 years 6 months ago
Automatic invariant strengthening to prove properties in bounded model checking
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...
Mohammad Awedh, Fabio Somenzi
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
13 years 7 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter
ATVA
2009
Springer
172views Hardware» more  ATVA 2009»
14 years 7 days ago
Symbolic CTL Model Checking of Asynchronous Systems Using Constrained Saturation
Abstract. The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivate...
Yang Zhao, Gianfranco Ciardo
FMICS
2008
Springer
13 years 7 months ago
Efficient Symbolic Model Checking for Process Algebras
Different approaches have been developed to mitigate the state space explosion of model checking techniques. Among them, symbolic verification techniques use efficient representati...
José Vander Meulen, Charles Pecheur
SPIN
2007
Springer
13 years 11 months ago
Towards Model Checking Spatial Properties with SPIN
Abstract. We present an approach for the verication of spatial properties with Spin. We rst extend one of Spin's main property specication mechanisms, i.e., the linear-time...
Alberto Lluch-Lafuente