论文信息 - Techniques for Memory-Efficient Model Checking of C and C++ Code - 字舞流文

Techniques for Memory-Efficient Model Checking of C and C++ Code

We present an overview of techniques that, in combination, lead to a memory-efficient implementation of a model checker for LLVM bitcode, suitable for verification of realistic C and C++ programs.

Vladimír Still | Petr Rockai | Jiri Barnat

[1] Vladimír Štill. State space compression for the DiVinE model checker , 2013 .

[2] Gerard J. Holzmann,et al. State Compression in SPIN: Recursive Indexing and Compression Training Runs , 2002 .

[3] Gerard J. Holzmann,et al. Coverage Preserving Reduction Strategies for Reachability Analysis , 1992, PSTV.

[4] Lubos Brim,et al. Improved State Space Reductions for LTL Model Checking of C and C++ Programs , 2013, NASA Formal Methods.

[5] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[6] Doron A. Peled,et al. Ten Years of Partial Order Reduction , 1998, CAV.

[7] Jaco Geldenhuys,et al. Runtime Efficient State Compaction in SPIN , 1999, SPIN.

[8] Jaco van de Pol,et al. A Database Approach to Distributed State-Space Generation , 2008, J. Log. Comput..

[9] Lubos Brim,et al. DiVinE 3.0 - An Explicit-State Model Checker for Multithreaded C & C++ Programs , 2013, CAV.

[10] Alfons Laarman,et al. Parallel Recursive State Compression for Free , 2011, SPIN.