Sciweavers

Share
SBMF
2010
Springer
129views Formal Methods» more  SBMF 2010»
9 years 7 days ago
Directed Model Checking for B: An Evaluation and New Techniques
ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...
Michael Leuschel, Jens Bendisposto
TSE
2011
214views more  TSE 2011»
9 years 13 days ago
A Comparative Study of Software Model Checkers as Unit Testing Tools: An Industrial Case Study
—Conventional testing methods often fail to detect hidden flaws in complex embedded software such as device drivers or file systems. This deficiency incurs significant developmen...
Moonzoo Kim, Yunho Kim, Hotae Kim
SIGOPS
2008
141views more  SIGOPS 2008»
9 years 5 months ago
Using model checkers in an introductory course on operating systems
During the last three years, we have been experimenting with the use of the Uppaal model checker in an introductory course on operating systems for first-year Computer Science stu...
Roelof Hamberg, Frits W. Vaandrager
ENTCS
2007
97views more  ENTCS 2007»
9 years 5 months ago
Can a Model Checker Generate Tests for Non-Deterministic Systems?
Modern software is increasingly concurrent, timed, distributed, and therefore, non-deterministic. While it is well known that tests can be generated as LTL or CTL model checker co...
Sergiy Boroday, Alexandre Petrenko, Roland Groz
IJFCS
2006
110views more  IJFCS 2006»
9 years 5 months ago
Sat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
Fang Yu, Bow-Yaw Wang
FMSD
2006
140views more  FMSD 2006»
9 years 5 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...
DLOG
2006
9 years 6 months ago
Model checking the basic modalities of CTL with Description Logic
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
SNPD
2008
9 years 7 months ago
Tools and Techniques for Model Checking Networked Programs
For software executing several threads in parallel, testing is unreliable, as it cannot cover all thread schedules. Model checking, however, can cover all possible thread interlea...
Cyrille Artho, Watcharin Leungwattanakit, Masami H...
TACAS
2000
Springer
151views Algorithms» more  TACAS 2000»
9 years 9 months ago
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
Ramesh Bharadwaj, Steve Sims
SPIN
1999
Springer
9 years 9 months ago
The Engineering of a Model Checker: The Gnu i-Protocol Case Study Revisited
In a recent study a series of model checkers, among which Spin [5], SMV [9], and a newer system called XMC [10], were compared on performance. The measurements used for this compar...
Gerard J. Holzmann
books