{"publication_identifier":{"isbn":["9783540664253"]},"publication":"Proceedings of the 10th International Conference on Concurrency Theory","author":[{"full_name":"Alur, Rajeev","first_name":"Rajeev","last_name":"Alur"},{"first_name":"Luca","last_name":"De Alfaro","full_name":"De Alfaro, Luca"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Mang","first_name":"Freddy","full_name":"Mang, Freddy"}],"doi":"10.1007/3-540-48320-9_8","page":"82 - 97","_id":"4602","language":[{"iso":"eng"}],"citation":{"ieee":"R. Alur, L. De Alfaro, T. A. Henzinger, and F. Mang, “Automating modular verification,” in <i>Proceedings of the 10th International Conference on Concurrency Theory</i>, Eindhoven, The Netherlands, 1999, vol. 1664, pp. 82–97.","mla":"Alur, Rajeev, et al. “Automating Modular Verification.” <i>Proceedings of the 10th International Conference on Concurrency Theory</i>, vol. 1664, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1999, pp. 82–97, doi:<a href=\"https://doi.org/10.1007/3-540-48320-9_8\">10.1007/3-540-48320-9_8</a>.","short":"R. Alur, L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 10th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1999, pp. 82–97.","ama":"Alur R, De Alfaro L, Henzinger TA, Mang F. Automating modular verification. In: <i>Proceedings of the 10th International Conference on Concurrency Theory</i>. Vol 1664. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 1999:82-97. doi:<a href=\"https://doi.org/10.1007/3-540-48320-9_8\">10.1007/3-540-48320-9_8</a>","apa":"Alur, R., De Alfaro, L., Henzinger, T. A., &#38; Mang, F. (1999). Automating modular verification. In <i>Proceedings of the 10th International Conference on Concurrency Theory</i> (Vol. 1664, pp. 82–97). Eindhoven, The Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/3-540-48320-9_8\">https://doi.org/10.1007/3-540-48320-9_8</a>","ista":"Alur R, De Alfaro L, Henzinger TA, Mang F. 1999. Automating modular verification. Proceedings of the 10th International Conference on Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 1664, 82–97.","chicago":"Alur, Rajeev, Luca De Alfaro, Thomas A Henzinger, and Freddy Mang. “Automating Modular Verification.” In <i>Proceedings of the 10th International Conference on Concurrency Theory</i>, 1664:82–97. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1999. <a href=\"https://doi.org/10.1007/3-540-48320-9_8\">https://doi.org/10.1007/3-540-48320-9_8</a>."},"conference":{"location":"Eindhoven, The Netherlands","end_date":"1999-08-27","start_date":"1999-08-24","name":"CONCUR: Concurrency Theory"},"year":"1999","volume":1664,"publist_id":"105","intvolume":"      1664","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.","date_updated":"2022-09-01T14:15:35Z","month":"01","article_processing_charge":"No","day":"01","type":"conference","abstract":[{"text":"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.","lang":"eng"}],"publication_status":"published","extern":"1","date_published":"1999-01-01T00:00:00Z","scopus_import":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_created":"2018-12-11T12:09:42Z","oa_version":"None","alternative_title":["LNCS"],"status":"public","title":"Automating modular verification","quality_controlled":"1"}