Sciweavers

9 search results - page 1 / 2
» Boom: Taking Boolean Program Model Checking One Step Further
Sort
View
TACAS
2010
Springer
181views Algorithms» more  TACAS 2010»
15 years 4 months ago
Boom: Taking Boolean Program Model Checking One Step Further
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
Gérard Basler, Matthew Hague, Daniel Kroeni...
KBSE
2007
IEEE
15 years 3 months ago
Model checking concurrent linux device drivers
toolkit demonstrates that predicate abstraction enables automated verification of real world Windows device Our predicate abstraction-based tool DDVerify enables the automated ve...
Thomas Witkowski, Nicolas Blanc, Daniel Kroening, ...
TACAS
2004
Springer
111views Algorithms» more  TACAS 2004»
15 years 2 months ago
Automatic Creation of Environment Models via Training
Abstract. Model checking suffers not only from the state-space explosion problem, but also from the environment modeling problem: how can one create an accurate enough model of the...
Thomas Ball, Vladimir Levin, Fei Xie
CAV
2004
Springer
151views Hardware» more  CAV 2004»
15 years 1 months ago
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Ganesh Gopalakrishnan, Yue Yang, Hemanthkumar Siva...
CORR
2006
Springer
113views Education» more  CORR 2006»
14 years 9 months ago
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
Frédéric Blanqui, Colin Riba