Symmetry and model checking

Emerson, E. Allen; Sistla, A. Prasad

doi:10.1007/bf00625970

Cited by 287 publications

(220 citation statements)

References 16 publications

Supporting

Mentioning

219

Contrasting

Order By: Relevance

“…Actually we do not consider parameterized benchmarks as the main field of application for our algorithm and thus we did not make use of symmetry reduction [11,5], neither within our tool nor within any competitor. The first column in Tab.…”

Section: Resultsmentioning

confidence: 99%

Fully Symbolic Model Checking for Timed Automata

Morbé

Pigorsch

Scholl

2011

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. In this paper we introduce a new formal model, called finite state machines with time (FSMT), to represent real-time systems. We present a model checking algorithm for FSMTs, which works on fully symbolic state sets containing both the clock values and the state variables. In order to verify timed automata (TAs) with our model checking algorithm, we present two different methods to convert TAs to FSMTs. In addition to pure interleaving semantics we can convert TAs to FSMTs having a parallelized interleaving behavior which allows parallelism of transitions causing no conflicts. This can dramatically reduce the number of steps during verification. Our experimental results show that our prototype implementation outperforms the state-of-the-art model checkers UPPAAL and RED.

show abstract

Section: Resultsmentioning

confidence: 99%

Fully Symbolic Model Checking for Timed Automata

Morbé

Pigorsch

Scholl

2011

Computer Aided Verification

View full text Add to dashboard Cite

show abstract

“…The main idea of symmetry reduction [7][8][9] is that symmetries in the system induce an equivalence relation on states of the concurrent system. While performing model checking, one can discard a state s if an equivalence state s ′ has been explored before.…”

Section: Symmetrymentioning

confidence: 99%

“…In contexts where models of the systems are verified, symmetry reduction has already been shown highly beneficial for reducing the search space [7][8][9]. The basic approach taken in these works is finding and exploring the state space of a quotient transition system defined by an underlying equivalence relation -usually over the system states.…”

Section: Introductionmentioning

confidence: 99%

Automatic Discovery of Transition Symmetry in Multithreaded Programs Using Dynamic Analysis

Yang

Chen

Gopalakrishnan

et al. 2009

Model Checking Software

View full text Add to dashboard Cite

Abstract. While symmetry reduction has been established to be an important technique for reducing the search space in model checking, its application in concurrent software verification is still limited, due to the difficulty of specifying symmetry in realistic software. We propose an algorithm for automatically discovering and applying transition symmetry in multithreaded programs during dynamic model checking. Our main idea is using dynamic program analysis to identify a permutation of variables and labels of the program that entails syntactic equivalence among the residual code of threads and to check whether the local states of threads are equivalent under the permutation. The new transition symmetry discovery algorithm can bring substantial state space savings during dynamic verification of concurrent programs. We have implemented the new algorithm in the dynamic model checker Inspect. Our preliminary experiments show that this algorithm can successfully discover transition symmetries that are hard or otherwise cumbersome to identify manually, and can significantly reduce the model checking time while using Inspect to examine realistic multithreaded applications.

show abstract

“…We want to be able to restrict the test process to subautom ata of specification and imple m entation that characterize these systems up to symmetry. In papers on exploiting symmetry in model checking [2,8,10,11,12,18], such subautom ata 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.…”

Section: Symmetrymentioning

confidence: 99%

Exploiting Symmetry in Protocol Testing

Romijn

Springintveld

1998

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Test generation and execution are often hampered by the large state spaces of the systems involved. In automata (or transition system) based test algorithms, taking advantage of symmetry in the behavior of specification and implementation may substantially reduce the amount of tests. We present a framework for describing and exploiting symmetries in black box test derivation methods based on finite state machines (FSMs). An algorithm is presented that, for a given symmetry relation on the traces of an FSM, computes a subautomaton that characterizes the FSM up to symmetry. This machinery is applied to Chow's classical W-method for test derivation. Finally, we focus on symmetries defined in terms of repeating patterns.

show abstract

Symmetry and model checking

Cited by 287 publications

References 16 publications

Fully Symbolic Model Checking for Timed Automata

Fully Symbolic Model Checking for Timed Automata

Automatic Discovery of Transition Symmetry in Multithreaded Programs Using Dynamic Analysis

Exploiting Symmetry in Protocol Testing

Contact Info

Product

Resources

About