C. S. Pasareanu, M. B. Dwyer, and M. Huth. Assumeguarantee model checking of software : A comparative case study. In Theoretical and Applied Aspects of SPIN Model Checking (LNCS 1680), Sept. 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....and an airport ground trac control simulation program. Since we are using in nite state veri cation techniques we do not restrict integer variables to nite domains. Using counting abstraction we are also able to verify these controllers for arbitrary number of user threads. Related Work: In [PDH99] the environment (i.e. the interface) of a software component is speci ed using LTL formulas. Then implementations of these environments are synthesized from the LTL speci cations and combined with the components and veri ed using nite state model checkers. We use nite state machines to ....

C. S. Pasareanu, M. B. Dwyer, and M. Huth. Assume guarantee model checking of software: A comparative case study. In Theoretical and Practical Aspects of SPIN Model Checking, volume 1680 of Lecture Notes in Computer Science, 1999.

....program guarantees to cover the behavior of temporal environment specifications. Besides, experiments indicate that synthesized environments enable faster model checking than temporal environment assumptions since generally temporal assumptions lead to larger state spaces to be searched [9]. The complexities for different assume guarantee reasoning styles with LTL (Linear Time Logic) or CTL (Computational Tree Logic) are explored in [6] 13] Generally speaking, using LTL and CTL as assumptions are both computation hard. The selection is a trade off depending on the applications. ....

....fragment of ACTL and LTL. Since the purpose of this tableau is not to be used in the assume guarantee verification, so the tableau size is not optimal. In [4] D. Long et al. proposed a tableau construction approach to connect the simulation relation and the satisfaction of an ACTL formula. In [9], C. S. Pasareanu et al. proposed the same environment synthesis idea for LTL formulas in the context of software model checking using the same tableau construction approach as that in SPIN. We share the similar ideas with the above approaches [5] 7] 4] 9] however, we target the maximum model of ....

[Article contains additional citation context not shown here]

C. S. Pasareanu, M. B. Dwyer, and M. Huth. Assumeguarantee model checking of software: A comparative case study. In Proceedings of SPIN Workshop 1999.

.... symbolically rather than explicitly [33] Our algorithms are insensitive to this difference; indeed, we performed the verification tasks in this paper on a model checker employing symbolic representations [43] Several researchers have described techniques for modular verification of designs [17, 22, 28, 36]. These techniques are based on a hardware oriented notion of modularity, in which modules are composed in parallel. For instance, one module might be a CPU, while another module represents a floating point co processor. The research then shows how to ensure the preservation of individual ....

C. S. Pasareanu, M. B. Dwyer, and M. Huth. Assume-guarantee model checking of software: A comparative case study. In Theoretical and Practical Aspects of SPIN Model Checking, volume 1680 of Lecture Notes in Computer Science. Springer-Verlag, 1999.

....reasoning have also been proposed, such as [BKP84, CM88, MP95] Yahav [Yah01] describes a method to model check multithreaded programs using a 3 valued logic [SRW99, LAS00] to abstract the store. This technique can verify interesting properties of small programs. Pasareanu et al. PDH99] also describe a model checking tool for compositional checking of finite state message passing systems. Abraham Mumm and deBoer [AMdB00] sketch a logic for verifying multi threaded Java programs indirectly via a translation to communicating sequential programs. 2 A number of tools have been ....

C.S. Pasareanu, M.B. Dwyer, and M. Huth. Assume-guarantee model checking of software: A comparative case study. In Theoretical and Practical Aspects of SPIN Model Checking, Lecture Notes in Computer Science 1680, 1999.

....in verification, in which one layer is shown to subsume the behavior of another [25] This work is orthogonal to ours, which does not require any abstraction relationship between collaborations. Several researchers have described modular verification techniques based on parallel composition [16, 20, 24, 29]. Some preliminary research [2, 11, 26] considers modular model checking under sequential composition, which is closer to the model used in software. Laster and Grumberg s approach [26] handles designs with only one state machine; it also lacks a design framework, such as collaboration based ....

C. S. Pasareanu, M. B. Dwyer, and M. Huth. Assume-guarantee model checking of software: A comparative case study. In Theoretical and Practical Aspects of SPIN Model Checking, volume 1680 of Lecture Notes in Computer Science. Springer-Verlag, 1999.

.... in conjunction with techniques developed by Hatcliff et al. that use abstraction and specialization techniques to reduce Java programs for verification [11] Dwyer and Pasareanu are developing automatic ways of generating environments for software systems to allow efficient model checking [9, 16]. Although we experimented with their filtering techniques, we found that the timer model constraints were more easily expressed operationally in Promela rather than declaratively as LTL constraints. However, further study is warranted because this is a critical problem. 8 CONCLUSIONS AND FUTURE ....

C. Pasareanu, M. Dwyer, and M. Huth. Assumeguarantee model checking of software: A comparative case study. In Proceedings of the 6th SPIN Workshop, Lecture Notes in Computer Science 1680, 1999.

No context found.

C. S. Pasareanu, M. B. Dwyer, and M. Huth. Assumeguarantee model checking of software : A comparative case study. In Theoretical and Applied Aspects of SPIN Model Checking (LNCS 1680), Sept. 1999.

No context found.

C. Pasareanu, M. Dwyer, and M. Huth. Assume-guarantee model checking of software: A comparative case study. In Proc. 6th SPIN Workshop, volume 1680 of LNCS. Springer-Verlag, 1999.

No context found.

C. P as areanu, M. Dwyer, and M. Huth. Assume-guarantee model checking of software: A comparative case study. In D. Dams, R. Gerth, S. Leue, and M. Massink, editors, Theoretical and Practical Aspects of SPIN Model Checking,vol- ume 1680 of Lecture Notes in Computer Science, pages 168-- 183. Springer-Verlag, 1999.

....We report about our attempt to automatically construct an environment for the DEOS kernel (used while model checking the kernel) The kernel was analyzed in [3, 4] and a bug was discovered. The authors of [3, 4] built the environment by hand. We successfully use the methods described in [1, 2]: we start with the most general definition of the environment, we establish a set of LTL environment assumptions and we use these assumptions to refine the environment definition. Using the refined environment, we discover the error that is reported in [3, 4] Moreover, the environment is precise ....

....the environment for DEOS. Promela and Spin do not handle real time, so the passing of time had to be modeled explicitly. Our study is aimed at automatically constructing the environment that models the generation of interrupts from a set of LTL constraints (or filters) as described in [1, 2], as opposed to the ad hoc method used in [3] We believe that our study shows that the methods from [1, 2] provide a simple and elegant solution to the problem of environment construction. As stated in [3] the construction of the environment is a serious problem that has to be solved, in order ....

[Article contains additional citation context not shown here]

C.S.Pasareanu, M.B.Dwyer, M.Huth. Assume-Guarantee Model Checking of Software: A Comparative Case Study - Spin'99.

No context found.

C. Pasareanu, M. Dwyer, and M. Huth. Assume-guarantee model checking of software: A comparative case study. In SPIN, pages 168--183, 1999.

No context found.

C. S. Pasareanu, M. B. Dwyer, and M. Huth. Assume guarantee model checking of software: A comparative case study. In Theoretical and Practical Aspects of SPIN Model Checking, volume 1680 of Lecture Notes in Computer Science, 1999. 14

No context found.

C. Pasareanu, M. Dwyer, and M. Huth. Assumeguarantee model checking of software: A comparative case study. In Proceedings of the 6th SPIN Workshop, Lecture Notes in Computer Science 1680, 1999.

No context found.

C. S. Pasareanu, M. B. Dwyer, and M. Huth. Assume-guarantee model checking of software: A comparative case study. In Theoretical and Practical Aspects of SPIN Model Checking, volume 1680 of Lecture Notes in Computer Science. Springer-Verlag, 1999.

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