Towards distributed software model-checking using decision diagrams

Authors:
Maximilien Colange;Souheib Baarir;Fabrice Kordon;Yann Thierry-Mieg
Affiliations:
LIP6, CNRS UMR 7606, Université P. & M. Curie --- Paris 6, Paris Cedex 05, France;LIP6, CNRS UMR 7606, Université Paris Ouest Nanterre La Défense, Nanterre Cedex, France;LIP6, CNRS UMR 7606, Université P. & M. Curie --- Paris 6, Paris Cedex 05, France;LIP6, CNRS UMR 7606, Université P. & M. Curie --- Paris 6, Paris Cedex 05, France
Venue:
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Year:
2013

Citing 11
Cited 0

Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Model checking

Model checking
Data Decision Diagrams for Petri Net Analysis

ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
FORCE: a fast and easy-to-implement variable-ordering heuristic

Proceedings of the 13th ACM Great Lakes symposium on VLSI
Hierarchical Set Decision Diagrams and Automatic Saturation

PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Saturation unbound

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
BEEM: benchmarks for explicit model checkers

Proceedings of the 14th international SPIN conference on Model checking software
DiVinE: Parallel Distributed Model Checker

PDMC-HIBI '10 Proceedings of the 2010 Ninth International Workshop on Parallel and Distributed Methods in Verification, and Second International Workshop on High Performance Computational Systems Biology
LTSMIN: distributed and symbolic reachability

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
State Space Analysis Using Symmetries on Decision Diagrams

ACSD '12 Proceedings of the 2012 12th International Conference on Application of Concurrency to System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Symbolic data structures such as Decision Diagrams have proved successful for model-checking. For high-level specifications such as those used in programming languages, especially when manipulating pointers or arrays, building and evaluating the transition is a challenging problem that limits wider applicability of symbolic methods. We propose a new symbolic algorithm, EquivSplit, allowing an efficient and fully symbolic manipulation of transition relations on Data Decision Diagrams. It allows to work with equivalence classes of states rather than individual states. Experimental evidence on the concurrent software oriented benchmark BEEM shows that this approach is competitive.