(Enter summary)
Abstract: . Assume-guarantee reasoning has long been advertised as an important method
for decomposing proof obligations in system verification. Refinement mappings (homomorphisms)
have long been advertised as an important method for solving the languageinclusion
problem in practice. When confronted with large verification problems, we therefore
attempted to make use of both techniques. We soon found that rather than offering
instant solutions, the success of assume-guarantee reasoning depends critically ... (Update)
Context of citations to this paper: More
.... of the system now can be e# ciently decomposed based on assume guarantee reasoning and compositional model checking [32] 33] 34] [35]: each wrapper is verified assuming a given protocol, and the protocol is verified separately. With regard to the design of digital...
...Equality, and resulted in an order of magnitude speedup. All previous work on formal verification of out of order processors [1] 2] 3][11][13] 14] 15] 16] 17] 18] 21] 23] 24] has examined designs that can issue and retire only a single instruction per clock cycle. In contrast,...
Cited by: More
Verification of Hybrid Controlled Processing Systems Based on.. - Frehse, al. (2001)
(Correct)
Formal Verification of the PCI Local Bus: A Step Towards IP Core.. - Wang (1999)
(Correct)
Microarchitecture Development via Metropolis Successive.. - Densmore, Rekhi, al. (2004)
(Correct)
Similar documents (at the sentence level):
10.7%: You Assume, We Guarantee: Methodology and Case Studies - Henzinger, Qadeer, Rajamani (1998)
(Correct)
5.7%: A Survey on Compositional Verification - Peng, Tahar (1998)
(Correct)
Active bibliography (related documents): More All
0.1: Formal Specification and Verification of a Dataflow.. - Thomas Henzinger Xiaojun (1999)
(Correct)
0.1: Assume-Guarantee Refinement Between Different Time Scales - Henzinger, Qadeer, Rajamani
(Correct)
0.1: Automated Refinement Checking for Asynchronous Processes - Alur, Grosu, Wang (2000)
(Correct)
Similar documents based on text: More All
0.4: Summarizing Procedures in Concurrent Programs - Qadeer, Rajamani, Rehof (2004)
(Correct)
0.3: Fair Bisimulation - Thomas Henzinger Sriram (2000)
(Correct)
0.2: MOCHA: Modularity in Model Checking - Alur, Henzinger, Mang, Qadeer.. (1998)
(Correct)
Related documents from co-citation: More All
3: A Compositional Rule for Hardware Design Refinement (context) - McMillan - 1997
2: A framework for comparing models of computation (context) - Lee, Sangiovanni-Vincentelli - 1998
2: Mocha : Modularity in Model Checking
- Alur, Henzinger et al. - 1998
BibTeX entry: (Update)
T. Henzinger, S. Qadeer, S.K. Rajamani, "You Assume, We Guarantee: Methodology and Case Studies." Proc. of CAV'98, June/July 1998. http://citeseer.ist.psu.edu/henzinger98you.html More
@inproceedings{ henzinger98you,
author = "Thomas A. Henzinger and Shaz Qadeer and Sriram K. Rajamani",
title = "You Assume, We Guarantee: Methodology and Case Studies",
booktitle = "Computer Aided Verification",
pages = "440-451",
year = "1998",
url = "citeseer.ist.psu.edu/henzinger98you.html" }
Citations (may not include all citations):
625
ACM Transactions on Programming Languages and Systems (context) - Lamport, program - 1983
625
ACM Transactions on Programming Languages and Systems (context) - Abadi, Lamport - 1995
293
Hierarchical correctness proofs for distributed algorithms
- Lynch, Tuttle - 1987
274
The existence of refinement mappings
- Abadi, Lamport - 1991
267
Computer-aided Verification of Coordinating Processes (context) - Kurshan - 1994
231
Model checking and abstraction
- Clarke, Grumberg et al. - 1992
121
Compositional model checking
- Clarke, Long et al. - 1989
108
Reactive modules
- Alur, Henzinger - 1996
97
Information and Computation (context) - Lynch, Vaandrager et al. - 1995
80
MOCHA : Modularity in model checking
- Alur, Henzinger et al. - 1998
67
ACM Transactions on Programming Languages and Systems (context) - Grumberg, Long et al. - 1994
60
Property-preserving simulations (context) - Bensalem, Bouajjani et al. - 1992
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
36
A proof technique for rely/guarantee properties
- Stark - 1985
22
Verifying out-of-order executions
- Damm, Pnueli - 1997
22
Prentice-Hall Inc (context) - Tanenbaum - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-cad.eecs.berkeley.edu/HomePages/shaz/publications.html): More
Verifying a Self-Stabilizing Mutual Exclusion Algorithm - Qadeer, Shankar (1996)
(Correct)
An Assume-Guarantee Rule For Checking Simulation - Henzinger, Qadeer, Rajamani, .. (1998)
(Correct)
Formal Verification of FIRE: A Case Study - Jae-Young Jang (1997)
(Correct)
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