Partial-order reduction in symbolic state-space exploration

R. Alur, R. Brayton, T.A. Henzinger, S. Qadeer, S. Rajamani, in:, Springer, 1997, pp. 340–351.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published
Author
; ; ; ;
Series Title
LNCS
Abstract
State space explosion is a fundamental obstacle in formal verification of designs and protocols. Several techniques for combating this problem have emerged in the past few years, among which two are significant: partial-order reductions and symbolic state space search. In asynchronous systems, interleavings of independent concurrent events are equivalent, and only a representative interleaving needs to be explored to verify local properties. Partial-order methods exploit this redundancy and visit only a subset of the reachable states. Symbolic techniques, on the other hand, capture the transition relation of a system and the set of reachable states as boolean functions. In many cases, these functions can be represented compactly using binary decision diagrams (BDDs). Traditionally, the two techniques have been practiced by two different schools—partial-order methods with enumerative depth-first search for the analysis of asynchronous network protocols, and symbolic breadth-first search for the analysis of synchronous hardware designs. We combine both approaches and develop a method for using partial-order reduction techniques in symbolic BDD-based invariant checking. We present theoretical results to prove the correctness of the method, and experimental results to demonstrate its efficacy.
Publishing Year
Date Published
1997-01-01
Acknowledgement
This research was supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the AFOSR contract F49620-93-1-0056, by the ARO MURI grant DAAH-04-96-1-0341, by the ARPA grant NAG2-892, and by the Semiconductor Research Corporation contracts DC-324.036 and DC-324.005.
Volume
1254
Page
340 - 351
Conference
CAV: Computer Aided Verification
IST-REx-ID

Cite this

Alur R, Brayton R, Henzinger TA, Qadeer S, Rajamani S. Partial-order reduction in symbolic state-space exploration. In: Vol 1254. Springer; 1997:340-351. doi:10.1007/3-540-63166-6_34
Alur, R., Brayton, R., Henzinger, T. A., Qadeer, S., & Rajamani, S. (1997). Partial-order reduction in symbolic state-space exploration (Vol. 1254, pp. 340–351). Presented at the CAV: Computer Aided Verification, Springer. https://doi.org/10.1007/3-540-63166-6_34
Alur, Rajeev, Robert Brayton, Thomas A Henzinger, Shaz Qadeer, and Sriram Rajamani. “Partial-Order Reduction in Symbolic State-Space Exploration,” 1254:340–51. Springer, 1997. https://doi.org/10.1007/3-540-63166-6_34.
R. Alur, R. Brayton, T. A. Henzinger, S. Qadeer, and S. Rajamani, “Partial-order reduction in symbolic state-space exploration,” presented at the CAV: Computer Aided Verification, 1997, vol. 1254, pp. 340–351.
Alur R, Brayton R, Henzinger TA, Qadeer S, Rajamani S. 1997. Partial-order reduction in symbolic state-space exploration. CAV: Computer Aided Verification, LNCS, vol. 1254. 340–351.
Alur, Rajeev, et al. Partial-Order Reduction in Symbolic State-Space Exploration. Vol. 1254, Springer, 1997, pp. 340–51, doi:10.1007/3-540-63166-6_34.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar