Partial-order reduction in symbolic state-space exploration

R. Alur, R. Brayton, T.A. Henzinger, S. Qadeer, S. Rajamani, Formal Methods in System Design 18 (2001) 97–116.

Download
No fulltext has been uploaded. References only!

Journal Article | Published
Author
; ; ; ;
Abstract
State-space explosion is a fundamental obstacle in the 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 reduction 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
2001-03-01
Journal Title
Formal Methods in System Design
Volume
18
Issue
2
Page
97 - 116
IST-REx-ID

Cite this

Alur R, Brayton R, Henzinger TA, Qadeer S, Rajamani S. Partial-order reduction in symbolic state-space exploration. Formal Methods in System Design. 2001;18(2):97-116. doi:10.1023/A:1008767206905
Alur, R., Brayton, R., Henzinger, T. A., Qadeer, S., & Rajamani, S. (2001). Partial-order reduction in symbolic state-space exploration. Formal Methods in System Design, 18(2), 97–116. https://doi.org/10.1023/A:1008767206905
Alur, Rajeev, Robert Brayton, Thomas A Henzinger, Shaz Qadeer, and Sriram Rajamani. “Partial-Order Reduction in Symbolic State-Space Exploration.” Formal Methods in System Design 18, no. 2 (2001): 97–116. https://doi.org/10.1023/A:1008767206905.
R. Alur, R. Brayton, T. A. Henzinger, S. Qadeer, and S. Rajamani, “Partial-order reduction in symbolic state-space exploration,” Formal Methods in System Design, vol. 18, no. 2, pp. 97–116, 2001.
Alur R, Brayton R, Henzinger TA, Qadeer S, Rajamani S. 2001. Partial-order reduction in symbolic state-space exploration. Formal Methods in System Design. 18(2), 97–116.
Alur, Rajeev, et al. “Partial-Order Reduction in Symbolic State-Space Exploration.” Formal Methods in System Design, vol. 18, no. 2, Springer, 2001, pp. 97–116, doi:10.1023/A:1008767206905.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar