D. Giannakopoulou, C. S. Pasareanu, and H. Barringer. Assumption generation for software component verification. In Proceedings of the ASE, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
What Went Wrong: Explaining Counterexamples - Groce, Visser (2002) (18 citations) (Correct)
....between positives and negatives should be taken a step further than merely noting concurrency only di erences. Another possibility is to generate from the negatives an automaton for an environment that avoids reproducing the error as in the work of Giannakopoulou, P as areanu, and Barringer [7]. It is possible that in some instances such an assumption might succinctly characterize the error, although as an assumption it would only be an approximation of the most general environment for the program. ....
D. Giannakopoulou, C. Pasareanu, and H. Barringer. Assumption Generation for Software Component Veri cation. To appear in 17th IEEE International Conference Automated Software Engineering, 2002.
What Went Wrong: Explaining Counterexamples - Groce, Visser (2003) (18 citations) (Correct)
....between positives and negatives should be taken a step further than merely noting concurrency only di erences. Another possi bility is to generate from the negatives an automaton for an environment that avoids reproducing the error as in the work of Giannakopoulou, P as areanu, and Barringer [7]. It is possible that in some instances such an assumption might succinctly characterize the error, although as an assumption it would only be an approximation of the most general environment for the program. ....
D. Giannakopoulou, C. Pasareanu, and H. Barringer. Assumption Generation for Software Component Veri cation. In Automated Software Engineering, 2002.
Automated Environment Generation for Software Model Checking - Tkachuk, Dwyer, Pasareanu (2003) (5 citations) Self-citation (Pasareanu) (Correct)
No context found.
D. Giannakopoulou, C. S. Pasareanu, and H. Barringer. Assumption generation for software component verification. In Proceedings of the 17th IEEE Conference on Automated Software Engineering, May 2002.
Assume-guarantee Verification of Source Code with.. - Giannakopoulou.. (2004) (1 citation) Self-citation (Giannakopoulou Pasareanu) (Correct)
No context found.
D. Giannakopoulou, C. S. Pasareanu, and H. Barringer. Assumption generation for software component verification. In Proc. of the Seventeenth IEEE Int. Conf. on Automated Software Eng., Sept. 2002.
Proof Rules for Automated Compositional Verification.. - Barringer.. (2003) (2 citations) Self-citation (Giannakopoulou Barringer) (Correct)
No context found.
D. Giannakopoulou, C. S. Pasareanu, and H. Barringer. Assumption generation for software component verification. In Proc. of the Seventeenth IEEE Int. Conf. on Auto. Soft. Eng., Sept. 2002.
Proof Rules for Automated Compositional Verification.. - Barringer.. (2003) (2 citations) Self-citation (Giannakopoulou Barringer) (Correct)
No context found.
D. Giannakopoulou, C. S. Pasareanu, and H. Barringer. Assumption generation for software component verification. In Proc. of the Seventeenth IEEE Int. Conf. on Auto. Soft. Eng., Sept. 2002.
Assume-guarantee Verification of Source Code with.. - Giannakopoulou.. (2004) (1 citation) Self-citation (Giannakopoulou Areanu) (Correct)
No context found.
D. Giannakopoulou, C. S. P as areanu, and H. Barringer. Assumption generation for software component verification. In Proc. of the Seventeenth IEEE Int. Conf. on Automated Software Eng., Sept. 2002.
Learning Assumptions for Compositional Verification - Cobleigh, Giannakopoulou.. (2003) (9 citations) Self-citation (Giannakopoulou Pasareanu) (Correct)
....#P ) #M 2 which, when simulated on M P err cannot lead to state #. The language (Aw ) of the assumption contains at least all traces of M 2 abstracted to # that prevent M 1 from violating P . Formally, Aw is such that, for any environment component ME , if and only if #Aw # [14]. In our framework, L learns the traces of Aw through the iterative process described in Section 3. The process terminates as soon as compositional verification returns conclusive results, which is often before the weakest assumption Aw is computed by L . For L to learn Aw , we need to provide ....
....ATL [1] was proposed for the specification and verification of open systems together with automated support via symbolic model checking procedures. The Mocha toolkit [2] provides support for modular verification of components with requirement specifications based on the ATL. In previous work [14], we presented an algorithm for automatically generating the weakest possible assumption for a component to satisfy a required property. Although the motivation of that work is di#erent, the ability to generate the weakest assumption can also be used to automate assume guarantee reasoning. The ....
[Article contains additional citation context not shown here]
D. Giannakopoulou, C. S. Pasareanu, and H. Barringer. Assumption generation for software component verification. In Proc. of the 17th IEEE Int. Conf. on Automated Software Engineering, Sept. 2002.
Learning Assumptions for Compositional Verification - Cobleigh, Giannakopoulou.. (2003) (9 citations) Self-citation (Giannakopoulou As) (Correct)
....when simulated on M 1 k P err cannot lead to state . The language L (Aw ) of the assumption contains at least all traces of M 2 abstracted to that prevent M 1 from violating P . Formally, Aw is such that, for any environment component ME , htruei M 1 k ME hP i if and only if htruei ME hAw i [14]. In our framework, L learns the traces of Aw through the iterative process described in Section 3. The process terminates as soon as compositional veri cation returns conclusive results, which is often before the weakest assumption Aw is computed by L . For L to learn Aw , we need to ....
....ATL [1] was proposed for the speci cation and veri cation of open systems together with automated support via symbolic model checking procedures. The Mocha toolkit [2] provides support for modular veri cation of components with requirement speci cations based on the ATL. In previous work [14], we presented an algorithm for automatically generating the weakest possible assumption for a component to satisfy a required property. Although the motivation of that work is di erent, the ability to generate the weakest assumption can also be used to automate assume guarantee reasoning. The ....
[Article contains additional citation context not shown here]
D. Giannakopoulou, C. S. Pasareanu, and H. Barringer. Assumption generation for software component veri cation. In Proc. of the 17th IEEE Int. Conf. on Automated Software Engineering, Sept. 2002.
Dynamic Component Substitutability Analysis - Natasha Sharygina Sagar (Correct)
No context found.
D. Giannakopoulou, C. S. Pasareanu, and H. Barringer. Assumption generation for software component verification. In Proceedings of the ASE, 2002.
Modular Verification of Concurrent Assembly Code with Dynamic.. - Feng, Shao (Correct)
No context found.
D. Giannakopoulou, C. S. Pasareanu, and H. Barringer. Assumption generation for software component verification. In ASE'02: Automated Software Engineering, pages 3--12, 2002.
Erroneous Architecture Is A Relative Concept - Adamek, Plasil (2004) (32 citations) (Correct)
No context found.
D. Giannakopoulou, C. S. Pasareanu, H. Barringer, Assumption Generation for Software Component Verification, Proceedings of the 17th IEEE International Conference on Automated Software Engineering, 2002
Failure-free Coordinator Synthesis for Correct Components.. - Inverardi, Tivoli (2003) (Correct)
No context found.
D. Giannakopoulou, C. S. Pasareanu, and H. Barringer. Assumption generation for software component verification. Proc. 17th IEEE Int. Conf. Automated Software Engineering 2002.
Breaking Up is Hard to Do: An Investigation of.. - Cobleigh, Avrunin.. (2004) (Correct)
No context found.
D. Giannakopoulou, C. S. P as areanu, and H. Barringer. Assumption generation for software component verification. In Proc. of the Seventeenth IEEE Int. Conference on Automated Software Engineering, pages 3--12, Sept. 2002.
What Went Wrong: Explaining Counterexamples - Groce, Visser (2003) (18 citations) (Correct)
No context found.
D. Giannakopoulou, C. Pasareanu, and H. Barringer. Assumption Generation for Software Component Verification. In 17th IEEE International Conference Automated Software Engineering, 2002.
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