scholarly journals Abstract Regular Tree Model Checking of Complex Dynamic Data Structures

2006 ◽  
pp. 52-70 ◽  
Author(s):  
Ahmed Bouajjani ◽  
Peter Habermehl ◽  
Adam Rogalewicz ◽  
Tomáš Vojnar
Keyword(s):  
Model Checking ◽  
Data Structures ◽  
Complex Dynamic ◽  
Tree Model ◽  
Dynamic Data Structures ◽  
Dynamic Data ◽  
Regular Tree

scholarly journals Efficient Bounded Model Checking of Heap-Manipulating Programs using Tight Field Bounds

2021 ◽  
pp. 218-239
Author(s):  
Pablo Ponzio ◽  
Ariel Godio ◽  
Nicolás Rosner ◽  
Marcelo Arroyo ◽  
Nazareno Aguirre ◽  
...  
Keyword(s):  
Model Checking ◽  
Data Structures ◽  
Efficient Algorithm ◽  
Bounded Model Checking ◽  
Model Checker ◽  
Data Types ◽  
Dynamic Data Structures ◽  
Dynamic Data ◽  
Software Model ◽  
Improve Model

AbstractSoftware model checkers are able to exhaustively explore different bounded program executions arising from various sources of non-determinism. These tools provide statements to produce non-deterministic values for certain variables, thus forcing the corresponding model checker to consider all possible values for these during verification. While these statements offer an effective way of verifying programs handling basic data types and simple structured types, they are inappropriate as a mechanism for nondeterministic generation of pointers, favoring the use of insertion routines to produce dynamic data structures when verifying, via model checking, programs handling such data types.We present a technique to improve model checking of programs handling heap-allocated data types, by taming the explosion of candidate structures that can be built when non-deterministically initializing heap object fields. The technique exploits precomputed relational bounds, that disregard values deemed invalid by the structure’s type invariant, thus reducing the state space to be explored by the model checker. Precomputing the relational bounds is a challenging costly task too, for which we also present an efficient algorithm, based on incremental SAT solving.We implement our approach on top of the bounded model checker, and show that, for a number of data structures implementations, we can handle significantly larger input structures and detect faults that is unable to detect.

scholarly journals Abstract regular (tree) model checking

2011 ◽  
Vol 14 (2) ◽  
pp. 167-191 ◽  
Author(s):  
Ahmed Bouajjani ◽  
Peter Habermehl ◽  
Adam Rogalewicz ◽  
Tomáš Vojnar
Keyword(s):  
Model Checking ◽  
Tree Model ◽  
Regular Tree

scholarly journals Abstract Regular Tree Model Checking

2006 ◽  
Vol 149 (1) ◽  
pp. 37-48 ◽  
Author(s):  
Ahmed Bouajjani ◽  
Peter Habermehl ◽  
Adam Rogalewicz ◽  
Tomáš Vojnar
Keyword(s):  
Model Checking ◽  
Tree Model ◽  
Regular Tree
Sign in / Sign up

Export Citation Format

Share Document