Wililiam Chan, Richard Anderson, Paul Beame, and David Notkin. Improving efficiency of symbolic model checking for state-based system requirements. In International Symposium on Software Testing and Analysis (ISSTA 98), Lect. Notes in Comp. Sci. Springer-Verlag, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....a static forward traversal, on the other hand, may result in a prolonged search through legal paths (i.e. paths that preserve the property) that will be revealed only when P is decided (these are the two walls in Fig. 2) A similar dilemma is associated with BDDbased techniques (see for example [6] and IS] It seems that the (unknown) ratio between the number of paths that go through unreachable states and the number of legal paths is crucial for determining the most efficient direction of traversal in both methodologies. The strict backward or forward BFS causes the constraints, either ....

Wililiam Chan, Richard Anderson, Paul Beame, and David Notkin. Improving efficiency of symbolic model checking for state-based system requirements. In International Symposium on Software Testing and Analysis (ISSTA 98), Lect. Notes in Comp. Sci. Springer-Verlag, 1998.

....(V V) of real time control software should be performed rigorously, but the complexities make V V difficult and timeconsuming. There are two major types of V V methods: formal verification and testing (including simulation) Many formal proof methods have been devised and proof systems developed [6][7] 20] But formal methods suffer from extreme complexity in mathematical expressions, and progress in handling several problematic factors such as time and concurrency is too slow to handle software of moderate size [19] Further, proof systems are still straggling with the exponential time and ....

W. Chan, R. J. Anderson, P. Beame, and D. Notkin, "Improving Efficiency of Symbolic Model Checking for State-Based System Requirements," Software Engineering Notes, ACM SIGSOFT, Vol. 23, No. 2, pp. 124-175, (March 1998).

....set of short traces, while SPIN, which uses a DFS algorithm, took less time and generated a small set of long traces. A more direct comparison of SMV and SPIN was made in [2] with comparable results. Chan et al. showed that different algorithms can effect the performance of symbolic model checking [4]. They modified SMV so that it could search either forwards or backwards. In their experiments on a software system, the backwards search worked better. Others, however, have reported that forward search works better on hardware systems [13] In our work, we do a direct comparison of algorithms to ....

W. Chan, R. J. Anderson, P. Beame, and D. Notkin. Improving efficiency of symbolic model checking for state-based system requirements. In Proc. of the

....around the aircraft for other aircraft that may be on a collision course, and takes evasive action if a collision is imminent. The entire specification for TCAS II (version 6. 04A) comprises a little over 400 pages [3] The requirements consist of two main parts, Own Aircraft and Other Aircraft [4]. We concentrated our efforts on several transitions with some of the most complex guarding conditions in one of the most complex portions of the TCAS II requirements specification. One of the states within the state Other Aircraft, Intruder Status, tracks the status of aircraft within the ....

W. Chan, R. Anderson, P. Beame, and D. Notkin. Improving efficiency of symbolic model checking for state-based system requirements. In International Symposium on Software Testing and Analysis (ISSTA), pages 102--112, March 1998.

....in the suggested order. Enforcing a static forward traversal, on the other hand, may result in a prolonged search through legal paths (i.e. paths that preserve the property) that will be revealed only when P k is decided. A similar dillema is associated with BDD based techniques (see for example [3] and [8] It seems that the (unknown) ratio between the number of unreachable states and the number of legal paths is crucial for determining the most efficient direction of traversal in both methodologies. The strict backward or forward BFS causes the constraints, either on the first or the ....

Wililiam Chan, Richard Anderson, Paul Beame, and David Notkin. Improving efficiency of symbolic model checking for state-based system requirements. In International Symposium on Software Testing and Analysis (ISSTA98), Lect. Notes in Comp. Sci. Springer-Verlag, 1998.

....static forward traversal, on the other hand, may result in a prolonged search through legal paths (i.e. paths that preserve the property) that will be revealed only when P k is decided (these are the two walls in Fig. 2) A similar dilemma is associated with BDDbased techniques (see for example [6] and [8] It seems that the (unknown) ratio between the number of paths that go through unreachable states and the number of legal paths is crucial for determining the most efficient direction of traversal in both methodologies. The strict backward or forward BFS causes the constraints, either ....

Wililiam Chan, Richard Anderson, Paul Beame, and David Notkin. Improving efficiency of symbolic model checking for state-based system requirements. In International Symposium on Software Testing and Analysis (ISSTA98), Lect. Notes in Comp. Sci. Springer-Verlag, 1998.

....of the state space leads to good performance results (both in time and space) Considering software, wide ranges of the variables involved might spoil the performance of OBDDbased techniques. However, first encouraging results in model checking software specifications also exists (e.g. [2, 5]) We plan to investigate abstraction techniques and employ a symbolic model checker (e.g. SMV [22] for statecharts. 8 CONCLUSION We have described how statecharts can be translated into Promela and mentioned two possible options: the generation of sequential or parallel code. The translation ....

W. Chan, R. J. Anderson, P. Beame, and D. Notkin. Improving efficiency of symbolic model checking for state-based system requirements. In Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA-98), volume 23,2 of ACM Software Engineering Notes, pages 102--112, New York, March2--5 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