Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Basic principles of mechanical theorem proving in elementary geometrics
Journal of Automated Reasoning
Mechanical geometry theorem proving
Mechanical geometry theorem proving
Algorithmic algebra
Algebraic and numeric techniques in modeling and robotics
Algebraic and numeric techniques in modeling and robotics
Essential Maple: an introduction for scientific programmers
Essential Maple: an introduction for scientific programmers
Verification of arithmetic circuits with binary moment diagrams
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Improving the Variable Ordering of OBDDs Is NP-Complete
IEEE Transactions on Computers
Introduction to Maple (2nd ed.)
Introduction to Maple (2nd ed.)
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Modern computer algebra
Formal verification in hardware design: a survey
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Model checking
Proceedings of the 38th annual Design Automation Conference
Symbolic Model Checking
A Performance Study of BDD-Based Model Checking
FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
VIS: A System for Verification and Synthesis
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Complete Solution Classification for the Perspective-Three-Point Problem
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computer algebra handbook
Parallel disk-based computation for large, monolithic binary decision diagrams
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
| Hi-index | 0.00 |
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.