scholarly journals Efficient SAT-based bounded model checking for software verification

2008 ◽  
Vol 404 (3) ◽  
pp. 256-274 ◽  
Author(s):  
Franjo Ivančić ◽  
Zijiang Yang ◽  
Malay K. Ganai ◽  
Aarti Gupta ◽  
Pranav Ashar
Keyword(s):  
Model Checking ◽  
Software Verification ◽  
Bounded Model Checking

Comparison of Model Checking Tools

2013 ◽  
Vol 659 ◽  
pp. 181-185
Author(s):  
Wei Gong ◽  
Jun Wei Jia
Keyword(s):  
Model Checking ◽  
Software Verification ◽  
Bounded Model Checking ◽  
Hardware Verification ◽  
Model Checker ◽  
Software And Hardware ◽  
Inherent Part

Model Checking is a method for verification. The model will be checked until the specification of it is proved or disproved. With the rising complexity of big models, there are non-checkable cases, in which cases the problem can be analyzed by some models, for example, bounded Model Checking means to analyze the model until a defined time or depth. The verification happens automatically. The programs for doing this are called Model Checking Tools or Model Checker. Model Checking are used in both software and hardware verification. It is an inherent part of hardware verification, whereas it is less used in the software verification.

scholarly journals Disk Based Software Verification via Bounded Model Checking

2007 ◽  
Author(s):  
Fernando Brizzolari ◽  
Igor Melatti ◽  
Enrico Tronci ◽  
Giuseppe Della Penna
Keyword(s):  
Model Checking ◽  
Software Verification ◽  
Bounded Model Checking

Concurrent Bug Finding Based on Bounded Model Checking

2020 ◽  
Vol 30 (05) ◽  
pp. 669-694
Author(s):  
Milena Vujošević Janičić
Keyword(s):  
Model Checking ◽  
Software Verification ◽  
Symbolic Execution ◽  
Bounded Model Checking ◽  
Sequential Approach ◽  
Software Analysis ◽  
Verification Tool ◽  
Single Compound ◽  
Bug Finding ◽  
Reliable Software

Automated and reliable software verification is of crucial importance for development of high-quality software. Formal methods can be used for finding different kinds of bugs without executing the software, for example, for finding possible run-time errors. The methods like model checking and symbolic execution offer very precise static analysis but on real world programs do not always scale well. One way to tackle the scalability problem is to apply new concurrent and sequential approaches to complex algorithms used in these kinds of software analysis. In this paper, we compare different variants of bounded model checking and propose two concurrent approaches: concurrency of intra-procedural analysis and concurrency of inter-procedural analysis. We implemented these approaches in a software verification tool LAV, a tool that is based on bounded model checking and symbolic execution. For assessing the improvements gained, we experimentally compared the concurrent approaches with the standard bounded model checking approach (where all correctness conditions are put into a single compound formula) and with a sequential approach (where correctness conditions are checked separately, one after the other). The results show that, in many cases, the proposed concurrent approaches give significant improvements.

scholarly journals Disk Based Software Verification via Bounded Model Checking

2007 ◽  
Author(s):  
Fernando Brizzolari ◽  
Igor Melatti ◽  
Enrico Tronci ◽  
Giuseppe Della Penna
Keyword(s):  
Model Checking ◽  
Software Verification ◽  
Bounded Model Checking

scholarly journals A Theory of Arrays with set and copy Operations

10.29007/q58t ◽  
2018 ◽  
Author(s):  
Stephan Falke ◽  
Carsten Sinz ◽  
Florian Merz
Keyword(s):  
Model Checking ◽  
Program Analysis ◽  
Software Verification ◽  
Symbolic Execution ◽  
Bounded Model Checking ◽  
Main Memory ◽  
Basic Theory ◽  
Analysis Software

The theory of arrays is widely used in order to model main memory in program analysis, software verification, bounded model checking, symbolic execution, etc. Nonetheless, the basic theory as introduced by McCarthy is not expressive enough for important practical cases since it only supports array updates at single locations. In programs, the memory is often modified using functions such as memset or memcpy/memmove, which modify a user-specified range of locations whose size might not be known statically. In this paper we present an extension of the theory of arrays with set and copy operations which make it possible to reason about such functions. We also discuss further applications of the theory.

Bounded Model Checking for Probabilistic Computation Tree Logic

2012 ◽  
Vol 23 (7) ◽  
pp. 1656-1668 ◽  
Author(s):  
Cong-Hua ZHOU ◽  
Zhi-Feng LIU ◽  
Chang-Da WANG
Keyword(s):  
Model Checking ◽  
Bounded Model Checking ◽  
Probabilistic Computation ◽  
Computation Tree Logic ◽  
Computation Tree

Bounded model checking of high-integrity software

2013 ◽  
Vol 33 (3) ◽  
pp. 9-10
Author(s):  
Sagar Chaki
Keyword(s):  
Model Checking ◽  
Bounded Model Checking ◽  
High Integrity

scholarly journals Contradictory antecedent debugging in bounded model checking

2009 ◽  
Author(s):  
Daniel Grosse ◽  
Robert Wille ◽  
Ulrich Kuehne ◽  
Rolf Drechsler
Keyword(s):  
Model Checking ◽  
Bounded Model Checking

scholarly journals Symbolic Causality Checking Using Bounded Model Checking

2015 ◽  
pp. 203-221 ◽  
Author(s):  
Adrian Beer ◽  
Stephan Heidinger ◽  
Uwe Kühne ◽  
Florian Leitner-Fischer ◽  
Stefan Leue
Keyword(s):  
Model Checking ◽  
Bounded Model Checking
Sign in / Sign up

Export Citation Format

Share Document