Automating modular verification

R. Alur, L. De Alfaro, T.A. Henzinger, F. Mang, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1999, pp. 82–97.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published
Author
; ; ;
Series Title
LNCS
Abstract
Modular techniques for automatic verification attempt to overcome the state-explosion problem by exploiting the modular structure naturally present in many system designs. Unlike other tasks in the verification of finite-state systems, current modular techniques rely heavily on user guidance. In particular, the user is typically required to construct module abstractions that are neither too detailed as to render insufficient benefits in state exploration, nor too coarse as to invalidate the desired systemproperties. In this paper, we construct abstractmodules automatically, using reachability and controllability information about the concrete modules. This allows us to leverage automatic verification techniques by applying them in layers: first we compute on the state spaces of system components, then we use the results for constructing abstractions, and finally we compute on the abstract state space of the system. Our experimental results indicate that if reachability and controllability information is used in the construction of abstractions, the resulting abstract modules are often significantly smaller than the concrete modules and can drastically reduce the space and time requirements for verification.
Publishing Year
Date Published
1999-01-01
Acknowledgement
This research was supported in part by the NSF CAREER award CCR-9734115, by the NSF CAREER award CCR-9501708, by the DARPA (NASA Ames) grant NAG2-1214, by the DARPA (Wright-Patterson AFB) grant F33615-98-C-3614, by the ARO MURI grant DAAH- 04-96-1-0341, and by the Gigascale Silicon Research Center.
Volume
1664
Page
82 - 97
Conference
CONCUR: Concurrency Theory
IST-REx-ID

Cite this

Alur R, De Alfaro L, Henzinger TA, Mang F. Automating modular verification. In: Vol 1664. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 1999:82-97. doi:10.1007/3-540-48320-9_8
Alur, R., De Alfaro, L., Henzinger, T. A., & Mang, F. (1999). Automating modular verification (Vol. 1664, pp. 82–97). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/3-540-48320-9_8
Alur, Rajeev, Luca De Alfaro, Thomas A Henzinger, and Freddy Mang. “Automating Modular Verification,” 1664:82–97. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1999. https://doi.org/10.1007/3-540-48320-9_8.
R. Alur, L. De Alfaro, T. A. Henzinger, and F. Mang, “Automating modular verification,” presented at the CONCUR: Concurrency Theory, 1999, vol. 1664, pp. 82–97.
Alur R, De Alfaro L, Henzinger TA, Mang F. 1999. Automating modular verification. CONCUR: Concurrency Theory, LNCS, vol. 1664. 82–97.
Alur, Rajeev, et al. Automating Modular Verification. Vol. 1664, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1999, pp. 82–97, doi:10.1007/3-540-48320-9_8.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar