Application of Wu's method to symbolic model checking

Model checking is widely used in verifying properties of concurrent systems. As an improvement, symbolic model checking uses OBDDs to alleviate the state explosion problem. However, the size of OBDDs greatly increases with the system becoming larger and more complex. In symbolic computation Wu's method is efficient to solve algebraic equations, and has succeeded in geometry theorem proving. In this paper, we present a framework to apply Wu's method to symbolic model checking. Briefly, symbolic model checking is carried out by using Wu's method to calculate the characteristic sets of polynomials that represent Kripke structures as well as CTL formulas. This is a new approach to model checking, and is a new successful application of Wu's method.

[1]  Hyungju Park,et al.  Symbolic computation and signal processing , 2004, J. Symb. Comput..

[2]  J. Ritt.  Partial differential algebra , 1950 .

[3]  Giovanni Gallo,et al.  Wu-Ritt Characteristic Sets and Their Complexity , 1990, Discrete and Computational Geometry.

[4]  Jianliang Tang,et al.  Complete Solution Classification for the Perspective-Three-Point Problem , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  André Heck,et al.  Introduction to Maple , 1993 .

[6]  Giovanni Gallo,et al.  Efficient algorithms and bounds for Wu-Ritt characteristic sets , 1991 .

[7]  Wu Wend.  AN APPROACH TOWARDS THE IMPLEMENTATION OF CHARACTERISTIC SET METHOD , 1999 .

[8]  Wen-tsün Wu.  Mechanical Theorem Proving in Geometries: Basic Principles , 1994 .

[9]  Bud Mishra,et al.  Algorithmic Algebra , 1993, Texts and Monographs in Computer Science.

[10]  Olivier Coudert,et al.  A Performance Study of BDD-Based Model Checking , 1998, FMCAD.

[11]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[12]  R. Bryant,et al.  Verification of Arithmetic Functions with Binary Moment Diagrams , 1994 .

[13]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[14]  Mark R. Greenstreet,et al.  Formal verification in hardware design: a survey , 1999, TODE.

[15]  R. Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[16]  Randal E. Bryant,et al.  Verification of Arithmetic Circuits with Binary Moment Diagrams , 1995, 32nd Design Automation Conference.

[17]  Erich Kaltofen,et al.  Computer algebra handbook , 2002 .

[18]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[19]  Marco Pistore,et al.  NuSMV 2: An OpenSource Tool for Symbolic Model Checking , 2002, CAV.

[20]  Tiziano Villa,et al.  VIS: A System for Verification and Synthesis , 1996, CAV.

[21]  S. Chou.  Mechanical Geometry Theorem Proving , 1987 .

[22]  Stephan Merz,et al.  Model Checking , 2000 .

[23]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[24]  D. Manocha,et al.  Algebraic and numeric techniques in modeling and robotics , 1992 .

[25]  Daniel Kroening,et al.  Automated pipeline design , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[26]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[27]  Robert M. Corless,et al.  Essential Maple: An Introduction for Scientific Programmers , 1995 .

[28]  Beate Bollig,et al.  Improving the Variable Ordering of OBDDs Is NP-Complete , 1996, IEEE Trans. Computers.

[29]  Dongming Wang,et al.  An Implementation of the Characteristic Set Method in Maple , 1995 .

[30]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[31]  Wenjun Wu,et al.  Basic principles of mechanical theorem proving in elementary geometries , 1986, Journal of Automated Reasoning.

[32]  Kenneth L. McMillan,et al.  The SMV System , 1993 .