| Alternate document: Details On the Complexity of Bounded-Variable Queries (Extended Abstract) (95) Moshe Y. Vardi |
Moshe Y. Vardi  Home/Search
Context Related
| rice.edu/~vardi/papers/lics95.ps.gz cornell.edu/kozen/686/Vardi...lics95.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: rice.edu/CS/Verification/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In modular verification the specification of a module consists of two parts. One part describes the guaranteed behavior of the module. The other part describes the assumed behavior of the environment with which the module is interacting. This is called the assume-guarantee paradigm. Even when one specifies the guaranteed behavior of the module in a branching temporal logic, the assumption in the assumeguarantee pair concerns the interaction of the environment with the module along each... (Update)
Similar documents based on text: More All
0.5: Synthesizing Dynamic Programming Algorithms from Linear.. - Rosu, Havelund (2001) (Correct)
0.3: Foundations for Circular Compositional Reasoning - Viswanathan, Viswanathan (Correct)
0.2: Nesting Until and Since in Linear Temporal Logic - Thérien, Wilke (Correct)
Related documents from co-citation: More All
11: the complexity of branching modular model checking (context) - Kupferman, Vardi - 1995
11: Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic S.. (context) - Clarke, Emerson et al. - 1986
10: Kluwer Academic Publishers (context) - McMillan, Checking - 1993
BibTeX entry: (Update)
M.Y. Vardi. On the complexity of modular model checking. In Proc. 10th LICS, June 1995. http://citeseer.ist.psu.edu/vardi95complexity.html More
@inproceedings{ vardi95complexity,
author = "Moshe Y. Vardi",
title = "On the Complexity of Modular Model Checking",
booktitle = "Logic in Computer Science",
pages = "101-111",
year = "1995",
url = "citeseer.ist.psu.edu/vardi95complexity.html" }
Citations (may not include all citations):1 Formuladependent equivalence for compositional CTL model che.. (context) - Sangiovanni-Vincentelli - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rice.edu/CS/Verification/): More
An Automata-Theoretic Approach to Branching-Time Model.. - Kupferman, Vardi, Wolper (1998) (Correct)
Computational Model Theory: An Overview - Vardi (1998) (Correct)
Bisimulation Minimization in an Automata-Theoretic.. - Fisler, Vardi (1998) (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