Reconstructing and Extending Regular Model Checking by Refinement of Transition Relation

Regular model checking is a framework for verifying parameterized and infinite-state systems. Techniques for regular model checking such as quotienting require a well-specified transition relation where the invariant of the system is represented implicitly. To relax the restriction, we propose a technique, which we call refinement of transition relation, and reconstruct and extend regular model checking by the technique. We apply the technique to a token-passing system and a program that dynamically mutates a heap structure.