{"acknowledgement":"This research was supported in part by the Office of Naval Research Young Investigator award N00014-95-1-0520, by the National Science Foundation CAREER award CCR-9501708, by the National Science Foundation grant CCR-9504469, by the Defense Advanced Research Projects Agency grant NAG2-1214, by the Army Research Office MURI grant DAAH-04-96-1-0341, and by the Semiconductor Research Corporation contract 97-DC-324.041.","year":"1998","oa_version":"None","month":"01","publication_identifier":{"isbn":["9783540651918"]},"publisher":"Springer","title":"An assume-guarantee rule for checking simulation","intvolume":" 1522","publication_status":"published","date_updated":"2022-08-24T10:00:50Z","quality_controlled":"1","conference":{"start_date":"1998-11-04","end_date":"1998-11-06","location":"Palo Alto, CA, United States of America","name":"FMCAD: Formal Methods in Computer-Aided Design"},"extern":"1","abstract":[{"lang":"eng","text":"The simulation preorder on state transition systems is widely accepted as a useful notion of refinement, both in its own right and as an efficiently checkable sufficient condition for trace containment. For composite systems, due to the exponential explosion of the state space, there is a need for decomposing a simulation check of the form P< s Q into simpler simulation checks on the components of P and Q. We present an assume-guarantee rule that enables such a decomposition. To the best of our knowledge, this is the first assume-guarantee rule that applies to a refinement relation different from trace containment. Our rule is circular, and its soundness proof requires induction on trace trees. The proof is constructive: given simulation relations that witness the simulation preorder between corresponding components of P and Q, we provide a procedure for constructing a witness relation for P< s Q. We also extend our assume-guarantee rule to account for fairness assumptions on transition systems"}],"date_published":"1998-01-01T00:00:00Z","language":[{"iso":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_created":"2018-12-11T12:09:06Z","scopus_import":"1","volume":1522,"alternative_title":["LNCS"],"publication":"Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design","page":"421 - 432","citation":{"apa":"Henzinger, T. A., Qadeer, S., Rajamani, S., & Tasiran, S. (1998). An assume-guarantee rule for checking simulation. In Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design (Vol. 1522, pp. 421–432). Palo Alto, CA, United States of America: Springer. https://doi.org/10.1007/3-540-49519-3_27","short":"T.A. Henzinger, S. Qadeer, S. Rajamani, S. Tasiran, in:, Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design, Springer, 1998, pp. 421–432.","chicago":"Henzinger, Thomas A, Shaz Qadeer, Sriram Rajamani, and Serdar Tasiran. “An Assume-Guarantee Rule for Checking Simulation.” In Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design, 1522:421–32. Springer, 1998. https://doi.org/10.1007/3-540-49519-3_27.","mla":"Henzinger, Thomas A., et al. “An Assume-Guarantee Rule for Checking Simulation.” Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design, vol. 1522, Springer, 1998, pp. 421–32, doi:10.1007/3-540-49519-3_27.","ieee":"T. A. Henzinger, S. Qadeer, S. Rajamani, and S. Tasiran, “An assume-guarantee rule for checking simulation,” in Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design, Palo Alto, CA, United States of America, 1998, vol. 1522, pp. 421–432.","ista":"Henzinger TA, Qadeer S, Rajamani S, Tasiran S. 1998. An assume-guarantee rule for checking simulation. Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, LNCS, vol. 1522, 421–432.","ama":"Henzinger TA, Qadeer S, Rajamani S, Tasiran S. An assume-guarantee rule for checking simulation. In: Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design. Vol 1522. Springer; 1998:421-432. doi:10.1007/3-540-49519-3_27"},"status":"public","type":"conference","publist_id":"242","doi":"10.1007/3-540-49519-3_27","day":"01","author":[{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"last_name":"Qadeer","first_name":"Shaz","full_name":"Qadeer, Shaz"},{"first_name":"Sriram","full_name":"Rajamani, Sriram","last_name":"Rajamani"},{"first_name":"Serdar","full_name":"Tasiran, Serdar","last_name":"Tasiran"}],"article_processing_charge":"No","_id":"4486"}