Sciweavers

109 search results - page 2 / 22
» Reducing Model Checking of the Many to the Few
Sort
View
COMPOS
1997
Springer
13 years 9 months ago
Compositional Reasoning in Model Checking
The main problem in model checking that prevents it from being used for veri cation of large systems is the state explosion problem. This problem often arises from combining parall...
Sergey Berezin, Sérgio Vale Aguiar Campos, ...
FMCAD
2007
Springer
13 years 11 months ago
Automated Extraction of Inductive Invariants to Aid Model Checking
Abstract— Model checking can be aided by inductive invariants, small local properties that can be proved by simple induction. We present a way to automatically extract inductive ...
Michael L. Case, Alan Mishchenko, Robert K. Brayto...
IPPS
2005
IEEE
13 years 11 months ago
Production Scheduling by Reachability Analysis - A Case Study
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
Gerd Behrmann, Ed Brinksma, Martijn Hendriks, Ange...
ATVA
2007
Springer
108views Hardware» more  ATVA 2007»
13 years 12 months ago
A New Approach to Bounded Model Checking for Branching Time Logics
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
Rotem Oshman, Orna Grumberg
ATVA
2008
Springer
104views Hardware» more  ATVA 2008»
13 years 7 months ago
A Direct Algorithm for Multi-valued Bounded Model Checking
Multi-valued Model Checking is an extension of classical, two-valued model checking with multi-valued logic. Multi-valuedness has been proved useful in expressing additional inform...
Jefferson O. Andrade, Yukiyoshi Kameyama