{"type":"conference","intvolume":" 1633","extern":"1","title":"Assume-guarantee refinement between different time scales","citation":{"ama":"Henzinger TA, Qadeer S, Rajamani S. Assume-guarantee refinement between different time scales. In: Proceedings of the 11th International Conference on Computer Aided Verification. Vol 1633. Springer; 1999:208-221. doi:10.1007/3-540-48683-6_20","apa":"Henzinger, T. A., Qadeer, S., & Rajamani, S. (1999). Assume-guarantee refinement between different time scales. In Proceedings of the 11th International Conference on Computer Aided Verification (Vol. 1633, pp. 208–221). Trento, Italy: Springer. https://doi.org/10.1007/3-540-48683-6_20","ieee":"T. A. Henzinger, S. Qadeer, and S. Rajamani, “Assume-guarantee refinement between different time scales,” in Proceedings of the 11th International Conference on Computer Aided Verification, Trento, Italy, 1999, vol. 1633, pp. 208–221.","mla":"Henzinger, Thomas A., et al. “Assume-Guarantee Refinement between Different Time Scales.” Proceedings of the 11th International Conference on Computer Aided Verification, vol. 1633, Springer, 1999, pp. 208–21, doi:10.1007/3-540-48683-6_20.","chicago":"Henzinger, Thomas A, Shaz Qadeer, and Sriram Rajamani. “Assume-Guarantee Refinement between Different Time Scales.” In Proceedings of the 11th International Conference on Computer Aided Verification, 1633:208–21. Springer, 1999. https://doi.org/10.1007/3-540-48683-6_20.","ista":"Henzinger TA, Qadeer S, Rajamani S. 1999. Assume-guarantee refinement between different time scales. Proceedings of the 11th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 1633, 208–221.","short":"T.A. Henzinger, S. Qadeer, S. Rajamani, in:, Proceedings of the 11th International Conference on Computer Aided Verification, Springer, 1999, pp. 208–221."},"doi":"10.1007/3-540-48683-6_20","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"conference":{"location":"Trento, Italy","name":"CAV: Computer Aided Verification","start_date":"1999-07-06","end_date":"1999-07-10"},"page":"208 - 221","date_created":"2018-12-11T12:09:06Z","publist_id":"243","_id":"4487","publication":"Proceedings of the 11th International Conference on Computer Aided Verification","status":"public","date_updated":"2022-09-02T09:04:26Z","day":"01","date_published":"1999-01-01T00:00:00Z","article_processing_charge":"No","publication_status":"published","publication_identifier":{"isbn":["9783540662020"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","month":"01","volume":1633,"year":"1999","oa_version":"None","abstract":[{"text":"Refinement checking is used to verify implementations against more abstract specifications. Assume-guarantee reasoning is used to decompose refinement proofs in order to avoid state-space explosion. In previous approaches, specifications are forced to operate on the same time scale as the implementation. This may lead to unnatural specifications and inefficiencies in verification. We introduce a novel methodology for decomposing refinement proofs of temporally abstract specifications, which specify implementation requirements only at certain sampling instances in time. Our new assume-guarantee rule allows separate refinement maps for specifying functionality and timing.We present the theory for the correctness of our methodology, and illustrate it using a simple example. Support for sampling and the generalized assume-guarantee rule have been implemented in the model checker Mocha and successfully applied to verify the VGI multiprocessor dataflow chip with 6 million transistors.","lang":"eng"}],"quality_controlled":"1","publisher":"Springer","author":[{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Qadeer","first_name":"Shaz","full_name":"Qadeer, Shaz"},{"full_name":"Rajamani, Sriram","first_name":"Sriram","last_name":"Rajamani"}]}