C. Colby, P. Godefroid, and L. J. Jagadeesan. Automatically closing open reactive programs. In SIGPLAN Conference on Programming Language Design and Implementation, pages 345--357, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....[19] executes C programs and has been successfully used to check communication protocols [5] Java PathFinder [3] consists of a modi ed Java virtual machine that can check concurrent Java programs. The diculties of environment modeling have been discussed before both in the context of Verisoft [8] and Java PathFinder [32] 8. CONCLUSION This paper has described tradeo s between both static analysis and model checking, as well as some of the surprises we encountered while applying model checking to large software systems. 9. ACKNOWLEDGMENTS This paper recounts research done with others. ....

Christopher Colby, Patrice Godefroid, and Lalita Jategaonkar Jagadeesan. Automatically closing open reactive programs. In SIGPLAN Conference on pages 345-357, 1998.

....directly to a key behavioural level concept (such as transactions) It is also necessary to ensure that the testing environment which interacts with the system addresses all issues. A tool which allows the automatic creation of such environments (which could be based on the approach described in [2]) needs to be constructed. Acknowledgement This work has been partially supported by a UoC Summer Scholarship. The authors thank the authors of Verisoft and FWTK for making the tool and the sources available free of charge. Special thanks to Patrice Godefroid for his encouragement and feedback ....

C. Colby, P. Godefroid, and L. J. Jagadeesan. Automatically closing open reactive programs. In SIGPLAN Conference on Programming Language Design and Implementation, pages 345--357, 1998.

....cannot be directly be translated into Spin objects. However, the details of the translation are not necessary for following the rest of this paper. be present in the abstract model. Our approach is based on a well known technique of using nondeterminism to broaden the scope of model checking [21, 11, 10]. However, earlier efforts have focused on abstracting simple types like integers. This paper demonstrates how these techniques can be extended to handle complex data types like records, unions, and arrays. This requires addressing additional problems that arise due to pointer aliasing. 4.1 ....

C. Colby, P. Godefroid, and L. J. Jagadeesan. Automatically Closing Open Reactive Programs. In Programming Languages Design and Implementation, 1998.

.... we also propose depth rst search and depth breadth search strategies, which, as far as we know, are not covered by previous studies in symbolic veri cation debugging in nite state systems, though both depth rst search and breadth rst search are adopted in a number of nite state model checkers [42, 19, 30, 49]. The depth breadth search technique in this paper is closely related to the mixed depth rst breadth rst approaches for BDD based [10, 11] nite state systems [35] But our depth breadth search technique targets at in nite state systems representable by Presburger formulas instead of nite state ....

....nite state real time systems. In addition, the work of Dill and Wong Toi does not consider depth rst and depth breadth search strategies with which our partial image technique can be combined. The dynamic environment generation technique is similar to the idea of Colby, Godefroid and Jagadeesan [19] in that both address the problem of automatically closing an open system, in which some of the components are not present. Their approach targets concurrent programs, instead of real time speci cations. Unlike doing static analysis of a concurrent program, our technique dynamically selects a ....

C. Colby, P. Godefroid and L. J. Jagadeesan, \Automatically closing open reactive programs," SIGPLAN Notices, vol. 33, no. 5, pp. 345-357, 1998.

....is similar to that in [DK99b] except that along each path in the execution tree a sequence of concrete environments is randomly generated. This greatly reduces the image size of the reachable node. The approach proposed in this paper is similar to the idea of Colby, Godefroid and Jagadeesan[CGJ98] in that both address the problem of automatically closing an open system, in which some of the components are presented. However, their approach is only applicable to a trivial subset of ASTRAL specifications. The reasons are as follows. Systems considered in [CGJ98] are not realtime systems. In ....

....Colby, Godefroid and Jagadeesan[CGJ98] in that both address the problem of automatically closing an open system, in which some of the components are presented. However, their approach is only applicable to a trivial subset of ASTRAL specifications. The reasons are as follows. Systems considered in [CGJ98] are not realtime systems. In an ASTRAL process, however, history dependency (i.e. the current state depends upon the past states) can also present complex timing constraints for the behaviors of the process. Thus, nondeterministically selecting an environment can not ensure that the selected ....

C. Colby, P. Godefroid and L. J. Jagadeesan, "Automatically closing open reactive programs," Proceedings of 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation, SIGPLAN Notices, vol. 33, No.5, 1998, pp. 345-357.

....selects a subset of the image and uses this subset to calculate the postimage at each node. The dynamic environment generation technique [14] generates a different sequence of imported variable values for different execution paths. It is similar to the idea of Colby, Godefroid and Jagadeesan [8] in that both address the problem of automatically closing an open system, in which some of the components are not present. Their approach targets concurrent programs (written in C) and is based upon static analysis of a program to translate it into a self executable closed form. By considering ....

C. Colby, P. Godefroid and L. J. Jagadeesan, "Automatically closing open reactive programs," Proceedings of 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation, SIGPLAN Notices, vol. 33, No.5, 1998, pp. 345-357.

....of source code and specifications. In there work, specifications can be thought of as assumptions or filters on a naive completion of a partial system given in code. Unlike our work, their approach is targeted to automated analysis of timing properties of systems. Colby, Godefroid and Jagadeesan [8] describe an automatable approach to completing reactive partial system. Unlike our approach, there work is aimed at producing a completed system that is executable in the context of the VeriSoft toolset [17] Their system completion acts as a controlling environment that causes the given partial ....

C. Colby, P. Godefroid, and L. J. Jagadeesan. Automatically closing open reactive programs. In ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation. ACM Press, June 1998. to appear.

No context found.

C. Colby, P. Godefroid, and L. J. Jagadeesan. Automatically Closing Open Reactive Programs. In Proceedings of 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 345--357, Montreal, June 1998. ACM Press.

.... on a same set of input data values may change over time (when the evaluation of a predicate may depend on data previously modified during the current execution) How to close automatically any open reactive (Java) program with its most general environment is an interesting but hard problem [5] that is beyond the scope of the present work. Therefore, we will simply assume here, as is usually done in testing, that the user specifies a fixed set values(a) of possible data values for each input event a in I . Whenever event a is provided as input to the Sisl program during testing, a data ....

.... an open reactive system with its most general environment is related to the idea of hiding a set of visible actions of a process in a process calculus [13, 17] Closing automatically open reactive (event driven) programs for systematic testing (model checking) purposes has been studied in [5, 8]. For sequential (data driven) programs, numerous algorithms have also been proposed to automatically generate a set of input data that is sufficient to exercise and test all the possible paths in the control flow graph of a program, for instance. This previous work makes extensive use of static ....

Colby, C., Godefroid, P., and Jagadeesan, L. J. (1998a). Automatically Closing Open Reactive Programs. In Proceedings of 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 345--357, Montreal. ACM Press.

.... on a same set of input data values may change over time (when the evaluation of a predicate may depend on data previously modified during the current execution) How to close automatically any open reactive (Java) program with its most general environment is an interesting but hard problem [5] that is beyond the scope of the present work. Therefore, we will simply assume here, as is usually done in testing, that the user specifies a fixed set ######### of possible data values for each input event # in # . Whenever event # is provided as input to the Sisl program during testing, a data ....

.... an open reactive system with its most general environment is related to the idea of hiding a set of visible actions of a process in a process calculus [13, 17] Closing automatically open reactive (event driven) programs for systematic testing (model checking) purposes has been studied in [5, 8]. For sequential (data driven) programs, numerous algorithms have also been proposed to automatically generate a set of input data that is sufficient to exercise and test all the possible paths in the control flow graph of a program, for instance. This previous work makes extensive use of static ....

Colby, C., Godefroid, P., and Jagadeesan, L. J. (1998a). Automatically Closing Open Reactive Programs. In Proceedings of 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 345--357, Montreal. ACM Press.

No context found.

C. Colby, P. Godefroid, and L. J. Jagadeesan. Automatically closing open reactive programs. In SIGPLAN Conference on Programming Language Design and Implementation, pages 345--357, 1998.

No context found.

C. Colby, P. Godefroid, and L. Jagadeesan. Automatically closing open reactive programs. In Conf. on Prog. Lang. Design and Impl., pages 345--357, New York, NY, 1998. ACM Press.

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