K. Ajami, S. Haddad, and J.M. Ilie. Exploiting symmetry in linear time temporal logic model check ing: One step beyond. In B.Steen, ed. Proc. TACAS `98, vol. 1384 LNCS, pp. 52-67, 1998. Springer-Verlag. 12  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... and examples of groups where the orbit problem is easy to solve are considered in [13] These early results are extended to incorporate the notions of fairness [22] and partial order reduction [25] and an on the y extension is introduced [36] Symmetries in logical subformulas are exploited [2, 50] in LTL and CTL respectively. Symmetry reductions have been implemented within existing model checkers. For example the SMV system [51] includes a symmetry reduction package which uses the scalarset approach of Ip and Dill [45] A similar approach has been applied in the development of ....

K. Ajami, S. Haddad, and J.M. Ilie. Exploiting symmetry in linear time temporal logic model check ing: One step beyond. In B.Steen, ed. Proc. TACAS `98, vol. 1384 LNCS, pp. 52-67, 1998. Springer-Verlag. 12

....Symmetry reduction is an abstraction technique which endeavors to substantially ameliorate this state explosion problem by exploiting the fact that many computer systems are symmetric in their design and implementation (c.f. JR91] ID96] ES96] CEFJ96] HITZ95] MAV96] ES97] GS97] ET98] [AHI98]) Such symmetry can be seen to be a form of redundancy from the standpoint of model checking temporal logic formulae. The state graph M , of many synchronization and coordination protocols which are the parallel composition of n processes identical up to renaming, often exhibits considerable ....

....used for quite some time (c.f. Ko78] in switching theory. There, however, a system is partially symmetric if its group of symmetries over index set I is isomorphic to the full symmetry group of an index set I I . This type of partial symmetry has been handled explicitly by [ES96] CEFJ96] [AHI98] considers partial symmetry in a manner more analogous to our definition of sub symmetry. However, they deal only with partial symmetries of the formula (or its automaton representation) to be model checked, rather than reduction of the structure itself. Abstraction of M , on the other hand, has ....

Ajami, K., Haddad, S. and Ilie, J.-M., Exploiting Symmetry in Linear Time Temporal Logic Model Checking: One Step Beyond. In Tools and Algorithms for the Construction and Analysis of Systems, 4th Interntational Conference, ETAPS98 LNCS 1384, Springer Verlag, 1998. 9

....ignoring that programs might exhibit many other symmetries that could be exploited in order to produce important state space reductions. Examples in the literature involve processes [12] variables of a special symmetry preserving type (scalarset) 8] and symmetries of temporal logic speci cations [3, 22, 25]. The reason we focus on heap symmetries when model checking object based software is that, in dynamic programs, the number of objects manipulated is usually much larger than the number of other components, such as the threads. Consequently, the signi cantly larger number of permutations on ....

K. Ajami, S. Haddad, J.M. Ilie. Exploiting Symmetry in Linear Time Temporal Logic Model Checking: One Step Beyond, Proc. TACAS98, LNCS 1384 (1998) pp 52 - 67

.... Symmetry reduction is an abstraction technique which endeavors to substantially ameliorate this state explosion problem by exploiting the fact that many computer systems are symmetric in their design and implementation (cf. JR91] ID96] ES96] CE 96] HI 95] MAV96] ES97] GS97] ET98] [AHI98]) Such symmetry can be seen to be a form of redundancy from the standpoint of model checking temporal logic formulae. The state graph, M , of many synchronization and coordination protocols which are the parallel composition of n processes identical up to renaming, often exhibits considerable ....

....for quite some time (cf. Ko78] in switching theory. There, however, a system is partially symmetric if its group of symmetries over index set I is isomorphic to the full symmetry group of an index set I 0 I. This type of partial symmetry has been handled explicitly by [ES96] and [CE 96] [AHI98] considers partial symmetry in a manner more analogous to our definition of sub symmetry. However, they deal only with partial symmetries of the formula (or its automaton representation) to be model checked, rather than reduction of the structure itself. Abstraction of M , on the other hand, has ....

Ajami, K., Haddad, S. and Ilie, J.-M., Exploiting Symmetry in Linear Time Temporal Logic Model Checking: One Step Beyond. In Tools and Algorithms for the Construction and Analysis of Systems, 4th Interntational Conference, ETAPS98 LNCS 1384, Springer Verlag, 1998.

....Symmetry 4 3 Symmetry In this section we introduce the notion of symmetry employed in this paper. We want to be able to restrict the test process to subautomata of specification and implementation that characterize these systems up to symmetry. In papers on exploiting symmetry in model checking [2, 8, 10, 11, 12, 19], such subautomata are constructed for explicitly given FSMs by identifying and collapsing symmetrical states. We are concerned with black box testing, and, by definition, it is impossible to refer directly to the states of a black box. In traditional FSM based test theory, FSMs are assumed to be ....

K. Ajami, S. Haddad, and J-M. Ilie. Exploiting symmetry in linear time temporal logic model checking: One step beyond. In Ste#en [25], pages 52--67.

....Symmetry 4 3 Symmetry In this section we introduce the notion of symmetry employed in this paper. We want to be able to restrict the test process to subautomata of specification and implementation that characterize these systems up to symmetry. In papers on exploiting symmetry in model checking [2, 8, 10, 11, 12, 19], such subautomata are constructed for explicitly given FSMs by identifying and collapsing symmetrical states. We are concerned with black box testing, and, by definition, it is impossible to refer directly to the states of a black box. In traditional FSM based test theory, FSMs are assumed to be ....

K. Ajami, S. Haddad, and J-M. Ili'e. Exploiting symmetry in linear time temporal logic model checking: One step beyond. In Steffen [25], pages 52--67.

....0 A ) 2 3 SYMMETRY In this section we introduce the notion of symmetry employed in this paper. We want to be able to restrict the test process to subautomata of specification and implementation that characterize these systems up to symmetry. In papers on exploiting symmetry in model checking [2, 8, 10, 11, 12, 17], such subautomata are constructed for explicitly given FSMs by identifying and collapsing symmetrical states. We are concerned with black box testing, and, by definition, it is impossible to refer directly to the states of a black box. In traditional FSM based test theory, FSMs are assumed to be ....

K. Ajami, S. Haddad and J-M. Ilie. Exploiting symmetry in linear time temporal logic model checking: One step beyond. In Steffen [22], pages 52--67.

.... of a model checking procedure [7] Approaches to attenuate the impact of a potential state space explosion can be roughly classified as exploiting an efficient representation of the state space [4] abstract interpretation of the state space [8, 9, 16] symmetries on the state space [12, 5, 2] quotienting of computation paths by an appropriate relation [20, 21, 14, 27] The latter approach is sometimes called partial order reduction for historical reasons [18] and it is where the work presented here belongs to. Partial order reductions are based on the observation that modelling ....

K. Ajami, S. Haddad, and J.-M. Illi'e. Exploiting symmetry in linear time temporal logic model checking: one step beyond. In B. Steffen, editor, TACAS '98, volume 1384 of Lecture Notes in Computer Science, pages 52--67. Springer-Verlag, 1998.

....0 A ) 2 3. Symmetry In this section we introduce the notion of symmetry employed in this paper. We want to be able to restrict the test process to subautomata of specification and implementation that characterize these systems up to symmetry. In papers on exploiting symmetry in model checking [2, 8, 10, 11, 12, 18], such subautomata are constructed for explicitly given FSMs by identifying and collapsing symmetrical states. We are concerned with black box testing, and, by definition, it is impossible to refer directly to the states of a black box. In traditional FSM based test theory, FSMs are assumed to be ....

K. Ajami, S. Haddad and J-M. Ili'e. Exploiting symmetry in linear time temporal logic model checking: One step beyond. In Steffen [23], pages 52--67.

No context found.

K. Ajami, S. Haddad, and J.-M. Ilie, Exploiting symmetry in linear time temporal logic model checking: one step beyond. In Tools and Algorithms for the Construction and Analysis of Systems, 4th International Conference, ETAPS-98 , LNCS 1384, Springer, 1998.

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