Thomas A. Henzinger, Shaz Qadeer, Sriram K. Rajamani  Home/Search
Context Related
Links: ACM DBLP | berkeley.edu/~tah/...antee_reasoning.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/~t...antee_reasoning (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Model-checking algorithms can be used to verify, formally and automatically, if a low-level description of a design conforms with a high-level description. However, for designs with very large state spaces, prior to the application of an algorithm, the refinement-checking task needs to be decomposed into subtasks of manageable complexity. It is natural to decompose the task following the component structure of the design. However, an individual component often does not satisfy its... (Update)
Context of citations to this paper: More
...f , and that g 0 refines g. Assume guarantee rules for compositional verification are more elaborate, but have the same direction [1, 9]: given the composite system, if we establish properties of the components, then we can conclude properties of the composite system....
...practice than parallel composition. The latter requires complex decompositions of properties to align properties with modular boundaries [24]; with feature oriented modules, properties and modules naturally align because both tend to originate from the same source, namely the...
Cited by: More
Efficient Verification of Sequential and Concurrent C.. - Chaki, Clarke, Groce, .. (2004) (Correct)
Automated, Compositional and Iterative Deadlock Detection - Chaki, Clarke, Ouaknine.. (Correct)
Automating Formal Modular Verification of Asynchronous.. - Hsiung, Cheng (Correct)
Active bibliography (related documents): More All
0.4: Automated Refinement Checking for Asynchronous Processes - Alur, Grosu, Wang (2000) (Correct)
0.3: Foundations for Circular Compositional Reasoning - Viswanathan, Viswanathan (Correct)
0.2: On the Completeness of Compositional Reasoning - Namjoshi, Trefler (2000) (Correct)
Similar documents based on text: More All
0.2: Formal Specification and Verification of a Dataflow.. - Henzinger, Liu.. (1999) (Correct)
0.2: Assume-Guarantee Refinement Between Different Time Scales - Henzinger, Qadeer, Rajamani (Correct)
0.2: Partial-Order Reduction in Symbolic State Space.. - Alur, Brayton.. (1997) (Correct)
Related documents from co-citation: More All
4: Model Checking - Clarke, Grumberg et al. - 1994
2: Lazy compositional verification - Shankar - 1998
2: The control of synchronous systems - de Alfaro, Henzinger et al. - 2000
BibTeX entry: (Update)
T.A. Henzinger, S. Qadeer, and S.K. Rajamani. Decomposing refinement proofs using assume-guarantee reasoning. In Int. Conf. Computer-aided Design, pp. 245-- 252. IEEE Computer Society Press, 2000. http://citeseer.ist.psu.edu/henzinger00decomposing.html More
@inproceedings{ henzingerdecomposing,
author = "Thomas A. Henzinger and Shaz Qadeer and Sriram K. Rajamani",
title = "Decomposing Refinement Proofs using {Assume-Guarantee} Reasoning",
pages = "245--253",
url = "citeseer.ist.psu.edu/henzinger00decomposing.html" }
Citations (may not include all citations):168 ACM Transactions on Programming Languages and Systems (context) - Abadi, Lamport - 1993
168 ACM Transactions on Programming Languages and Systems (context) - Abadi, Lamport - 1995
108 Reactive modules - Alur, Henzinger - 1996 ACM DBLP
80 Mocha: modularity in model checking - Alur, Henzinger et al. - 1998 DBLP
75 IEEE Transactions on Software Engineering (context) - Misra, Chandy et al. - 1981
46 Verification of an implementation of Tomasulo's algorithm by.. (context) - McMillan - 1998
41 we guarantee: methodology and case studies (context) - Henzinger, Qadeer et al. - 1998
39 A compositional rule for hardware design refinement (context) - McMillan - 1997 ACM DBLP
14 The formal design of 1M-gate ASICs (context) - Eiriksson - 1998 ACM DBLP
12 Local liveness for compositional modeling of fair reactive s.. - Alur, Henzinger - 1995 ACM DBLP
12 Circular compositional reasoning about liveness - McMillan - 1999 ACM DBLP
8 An assume-guarantee rule for checking simulation - Henzinger, Qadeer et al. - 1998 ACM DBLP
6 Formal specification and verification of a dataflow processo.. - Henzinger, Liu et al. - 1999 ACM DBLP
6 Assume-guarantee refinement between different time scales - Henzinger, Qadeer et al. - 1999 ACM DBLP
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC