Title :
Exploiting heap symmetries in explicit-state model checking of software
Author_Institution :
Dept. of Comput. & Inf. Sci., Kansas State Univ., Manhattan, KS, USA
Abstract :
Detecting symmetries in the structure of systems is a well known technique falling in the class of bisimulation (strongly) preserving state space reductions. Previous work in applying symmetries to aid model checking focuses mainly on process topologies and user specified data types. We applied the symmetry framework to model checking object-based programs that manipulate dynamically created objects, and developed a linear-time heuristic for finding the canonical representative of a symmetry equivalence class. The strategy was implemented in the object-based model checker dSPIN and some experiments, yielding encouraging results, have been carried out.
Keywords :
bisimulation equivalence; data structures; equivalence classes; object-oriented programming; program verification; bisimulation; canonical representative; dSPIN; dynamically created objects; explicit-state model checking; heap symmetries; linear-time heuristic; model checking; object-based model checker; object-based programs; process topologies; software checking; state space reductions; symmetry equivalence class; symmetry framework; user specified data types; Automatic logic units; Explosions; Hardware; Interleaved codes; Java; Protocols; Runtime; State-space methods; Topology; Yarn;
Conference_Titel :
Automated Software Engineering, 2001. (ASE 2001). Proceedings. 16th Annual International Conference on
Print_ISBN :
0-7695-1426-X
DOI :
10.1109/ASE.2001.989811