PBMC:Symbolic slicing for the verification of concurrent programs

Saissi, H. and Bokor, P. and Suri, Neeraj (2015) PBMC:Symbolic slicing for the verification of concurrent programs. In: Automated Technology for Verification and Analysis. Springer-Verlag, pp. 344-360. ISBN 9783319249520

Full text not available from this repository.


This paper proposes a novel optimization of bounded model checking (BMC) for better run-time efficiency. Specifically, we define projections, an adaptation of dynamic program slices, and instruct the bounded model checker to check projections only. Given state properties over a subset of the program’s variables, we prove the soundness of the proposed optimization. We propose a symbolic encoding of projections and implement it for a prototype language of concurrent programs. We have developed a tool called PBMC to evaluate the efficiency of the proposed approach. Our evaluation with various concurrent programs justifies the potential of projections to efficient verification. © Springer International Publishing Switzerland 2015.

Item Type:
Contribution in Book/Report/Proceedings
ID Code:
Deposited By:
Deposited On:
14 Oct 2019 14:06
Last Modified:
15 Sep 2023 02:03