Proceedings of the 2011 ACM Symposium on Applied Computing 2011
DOI: 10.1145/1982185.1982528
|View full text |Cite
|
Sign up to set email alerts
|

A dynamic constraint-based BMC strategy for generating counterexamples

Abstract: Checking safety properties is mandatory in the validation process of critical software. When formal verification tools fail to prove some properties, the automatic generation of counterexamples for a given loop depth is achievable, and is therefore an important issue in practice. We propose in this paper a dynamic constraint based exploration strategy for software bounded model checking. Constraint solving is integrated with state exploration to prune state space. Experiments on a real industrial Flasher Manag… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…3.2 and 3.3). For each property, we compare the results obtained with DPVS [13] to those obtained with CBMC [10], a state-of-the-art bounded…”
Section: Resultsmentioning
confidence: 99%
“…3.2 and 3.3). For each property, we compare the results obtained with DPVS [13] to those obtained with CBMC [10], a state-of-the-art bounded…”
Section: Resultsmentioning
confidence: 99%
“…This work represents a continuation of the work done in the DANOCOPS project 3 . A similar approach has been proposed by Collavizza et al [27], using a bounded model-checking approach to generate counter-examples of program properties using the Comet platform.…”
Section: Related Workmentioning
confidence: 99%