Clarke E. M., Long D. E. and McMillan K. L. [1989], Compositional model checking, in `Proc. 4th Ann. IEEE Symp. on Logic in Computer Science (LICS '89)', Asilomar, Calif. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Learning Assumptions for Compositional Verification - Cobleigh, Giannakopoulou.. (2003) (9 citations) (Correct)
....that satisfies an assumption A. Intuitively, A characterizes all contexts in which the component is expected to operate correctly. To complete the proof, it must also be shown that the remaining components in the system, i.e. M s environment, satisfy A. Several frameworks have been proposed [18,21,7,16,24,17] to support this style of reasoning. However, their practical impact has been limited because they require non trivial human input in defining assumptions that are strong enough to eliminate false violations, but that also reflect the remaining system appropriately. In contrast, this paper ....
....order to reason formally about components in isolation, some form of assumption (either implicit or explicit) about the interaction with, or interference from, the environment has to be made. Even though we have sound and complete reasoning systems for assume guarantee reasoning, see for example [18,21,7,16,24], it is always a mental challenge to obtain the most appropriate assumption [17] It is even more of a challenge to find automated techniques to support this style of reasoning. The thread modular reasoning underlying the Calvin tool [12] is one start in this direction. In the framework of ....
E. M. Clarke, D. E. Long, and K. L. McMillan. Compositional model checking. In Proc. of the 4th Symp. on Logic in Computer Science, pages 353--362, June 1989.
Learning Assumptions for Compositional Verification - Cobleigh, Giannakopoulou.. (2003) (9 citations) (Correct)
....that satis es an assumption A. Intuitively, A characterizes all contexts in which the component is expected to operate correctly. To complete the proof, it must also be shown that the remaining components in the system, i.e. M s environment, satisfy A. Several frameworks have been proposed [7, 16 18, 21, 24] to support this style of reasoning. However, their practical impact has been limited because they require non trivial human input in de ning assumptions that are strong enough to eliminate false violations, but that also re ect the remaining system appropriately. In contrast, this paper ....
....order to reason formally about components in isolation, some form of assumption (either implicit or explicit) about the interaction with, or interference from, the environment has to be made. Even though we have sound and complete reasoning systems for assume guarantee reasoning, see for example [7, 16, 18, 21, 24], it is always a mental challenge to obtain the most appropriate assumption [17] It is even more of a challenge to nd automated techniques to support this style of reasoning. The thread modular reasoning underlying the Calvin tool [12] is one start in this direction. In the framework of ....
E. M. Clarke, D. E. Long, and K. L. McMillan. Compositional model checking. In Proc. of the 4th Symp. on Logic in Computer Science, pages 353-362, June 1989.
Minimization and Minimal Realization in Span(Graph) - Rosebrugh, Sabadini (Correct)
....that the minimization process described here is locally functorial as well as compositional, and is expressible as a local adjunction. This gives a mathematically precise expression of the meaning of compositional minimal realization which has been a goal of other workers in model checking [AE98] [CLM89], GSL96] As was the case in the earlier [BSW96] the minimization process is essentially one which kills the 2 cells , that is the morphisms between machines, so that the bicategory of minimized machines is locally discrete. We begin in Section 2 with a study of a minimization for labelled ....
E. Clarke, D. Long, and K. McMillan. Compositional model checking. In Proceedings of the Fourth Annual IEEE Symposium on Logic in Computer Science, 353--362, 1989.
Hybrid Verification by Exploiting the Environment - Fix, Schneider (1994) (2 citations) (Correct)
....behavior when the environment satisfies some assumptions. Logics for verifying safety properties of assume guarantee specifications are discussed in [9, 14, 21] liveness properties are treated in [1, 3, 23] and model checking techniques based on assume guarantee specifications are introduced in [6, 11]. Our approach differs from this open systems work both in the role played by the environment and in how state changes are made by the environment. We use the environment to represent aspects of the computation model and the scientific laws governing the behavior of environment variables not as ....
E.M. Clarke, D.E. Long, and K.L. McMillan. Compositional model checking. In Proceedings 4th IEEE Symposium on Logic in Computer Science, pages 353--362, 1989.
Lifting Assertion and Consistency Checkers From Single to.. - Huth, Pradhan (2002) (3 citations) (Correct)
....framework. We make no assumptions about the degree of precision that each view imposes on model checks # that mention external behavior, nor do we restrict the sound techniques utilized in gaining that precision be they (three valued) versions of compositional model checking [10], module checking [28] etc. Definition 5 (Refinement of collections of models) as above, we say that iff, for each v in the underlying three valued modelchecking framework. Note that M#M holds since refinements are preorders (property #7) We assume that the set of views V be ....
E. M. Clarke, D. E. Long, and K. L. McMillan. Compositional Model Checking. In Proceedings of the Fourth Annual Symposium on Logic in Computer Science, pages 353--361, Washington D. C., 1989. IEEE Computer Society Press.
DYNAMO DYNamic Assembly from MOdels Volume I - Technical Proposal - Rugaber (Correct)
....formalized component composition using module interconnection languages, which provide a shallow guarantee of composition correctness in terms of modular plug ability [37] More powerful analyses use models of the behavior of components to reason about how they will behave under composition (c.f. [16, 17, 61, 12, 13]) With one notable exception [34] these more powerful methods work by exhaustive analysis and can, therefore, only be applied tOilhire state models of a component. Techniques exist to abstract the behavior of a component into a finite state model (c.f. 60] however the mathematical maturity ....
E. M. Clarke, D. E. Long, and K. L. McMillan. Compositional model checking. In Fourth Annual Symposium on Logic in Computer Science, pages 353-362, 1989.
Verification of Temporal and Real-Time Properties of Statecharts - Levi (1997) (6 citations) (Correct)
....elegant treatment of parallel composition. With regard to statecharts, it is important to note that the non modularity of the semantics is a limitation for the application of many methods of compositional verification to statecharts. For instance the method of modular model checking suggested by [21] for CTL. The main idea is to find the conditions relating formulas , 1 and 2 such that, if model M 1 satisfies 1 and model M 2 satisfies 2 , then the parallel composition M 1 Theta M 2 satisfies . This kind of reasoning can be naturally formalized in the classical assumption commitment ....
E.M. Clarke, D.E. Long, and K.L. McMillian. Compositional model checking. In Proc. Fourth IEEE Symp. on Logic In Computer Science, pages 353--362. IEEE Computer Society Press, 1989.
Model Checking - Clarke, Schlingloff (2000) (755 citations) Self-citation (Clarke) (Correct)
No context found.
Clarke E. M., Long D. E. and McMillan K. L. [1989], Compositional model checking, in `Proc. 4th Ann. IEEE Symp. on Logic in Computer Science (LICS '89)', Asilomar, Calif.
Model Checking and Abstraction - Edmund Clarke Carnegie (1992) (202 citations) Self-citation (Clarke Long) (Correct)
No context found.
E. M. Clarke, D. E. Long, and K. L. McMillan. Compositional model checking. In Proceedings of the Fourth Annual Symposium on Logic in Computer Science, pages 353--362. IEEE Computer Society Press, June 1989.
Compositional Reasoning in Model Checking - Sergey Berezin Sergio (1998) (16 citations) Self-citation (Clarke) (Correct)
No context found.
E. M. Clarke, D. E. Long, and K. L. McMillan. Compositional model checking. In Proceedings of the Fourth Annual Symposium on Logic in Computer Science, pages 353#362. IEEE Computer Society Press, June 1989.
Verification and Implementation of Delay-Insensitive Processes.. - Kapoor, al. (2005) (Correct)
No context found.
Clarke, E. M., Long, D. E., McMillan, K. L.: Compositional Model Checking, Proceedings of Fourth Annual Symposium on Logic in Computer Science (LICS), June 1989.
Factorising Temporal Specifications - Huisman, Trentelman (2005) (Correct)
No context found.
Clarke, E., Long, D. & McMillan, K. (1989), Compositional model checking, in `Fourth IEEE Symposium on Logic in Computer Science', IEEE Press, pp. 353--362.
Model Checking Concurrent Systems with Unbounded Integer.. - Bultan, Gerber, Pugh (1998) (26 citations) (Correct)
No context found.
E. M. Clarke, D. E. Long, and K. L. McMillan. Compositional model checking. In Proc. of the 4th Annual IEEE Symposium on Logic in Computer Science, pages 464--475, June 1989.
Assume-guarantee Verification of Source Code with.. - Giannakopoulou.. (2004) (1 citation) (Correct)
No context found.
E. M. Clarke, D. E. Long, and K. L. McMillan. Compositional model checking. In Proc. of the Fourth Symp. on Logic in Comp. Sci., pages 353--362, June 1989.
LTL Model Checking for Modular Petri Nets - Latvala, Mäkelä (2004) (Correct)
No context found.
Clarke, E., Long, D., McMillan, K.: Compositional model checking. In Parikh, R., ed.: Proc. 4th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press (1989) 353--362
Proof Rules for Automated Compositional Verification.. - Barringer.. (2003) (2 citations) (Correct)
No context found.
E. M. Clarke, D. E. Long, and K. L. McMillan. Compositional model checking. In Proc. of the Fourth Symp. on Logic in Comp. Sci., pages 353--362, June 1989.
Equivalence-Based Reductions and checking for preorders - Bustan (2002) (Correct)
No context found.
E. M. Clarke, D. E. Long, and K. L. McMillan. Compositional model checking. In Proceedings, Fourth Annual 132 Symposium on Logic in Computer Science, pages 353--362, Asilomar Conference Center, Pacific Grove, California, 5--8 June 1989. IEEE Computer Society Press.
Proof Rules for Automated Compositional Verification.. - Barringer.. (2003) (2 citations) (Correct)
No context found.
E. M. Clarke, D. E. Long, and K. L. McMillan. Compositional model checking. In Proc. of the Fourth Symp. on Logic in Comp. Sci., pages 353--362, June 1989.
Reasoning about Programs by Exploiting The Environment - Fix, B.Schneider (1994) (4 citations) (Correct)
No context found.
Clarke, E.M., D.E. Long, and K.L. McMillan. Compositional model checking. Proceedings 4th IEEE Symposium on Logic in Computer Science (Palo Alto, CA. June 1989), 353-362.
Software Engineering Tools and Environments: - Roadmap William Harrison (Correct)
No context found.
Edmund M. Clarke, David E. Long, and K.L. McMillan. "Compositional Model Checking." Proceedings of the Fourth Annual IEEE Symposium on Logic in Computer Science, 1989.
Improving Compositional Verification of State-based Models - Reducing Modular Unbalance (Correct)
No context found.
Edmund M. Clarke, David E. Long, and Kenneth L. McMillan. Compositional Model Checking. In Proceedings of the 4 IEEE Symposium on Logic in Computer Science, pages 353--362, 1989.
Software Engineering Tools and Environments: - Roadmap William Harrison (Correct)
No context found.
Edmund M. Clarke, David E. Long, and K.L. McMillan. "Compositional Model Checking." Proceedings of the Fourth Annual IEEE Symposium on Logic in Computer Science, 1989.
Assume-guarantee Verification of Source Code with.. - Giannakopoulou.. (2004) (1 citation) (Correct)
No context found.
E. M. Clarke, D. E. Long, and K. L. McMillan. Compositional model checking. In Proc. of the Fourth Symp. on Logic in Comp. Sci., pages 353--362, June 1989.
A Counter Example Guided Abstraction Refinement Framework for.. - Chaki (2002) (Correct)
No context found.
E. Clarke, D. Long, and K. McMillan. Compositional model checking. In Proceedings of the Fourth Annual Symposium on Logic in computer science, pages 353--362. IEEE Press, 1989.
Model Checking for Open Systems: A Compositional Approach to.. - Andrade-Gomez (2001) (Correct)
No context found.
Edmund M. Clarke, David E. Long, and K.E. Mcmillan. Compositional model checking. In Proceedings of the Fourth Annual Symposium on Logic in Computer Science, pages 353--362. IEEE Computer Society Press, New York, June 1989.
First 50 documents Next 50
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