 
Summary: In ComputerAided Verification, CAV '96 (Rajeev Alur and Thomas A. Henzinger, eds.), LNCS vol. 1102, 1991, 2637, c
flSpringerVerlag
Symbolic Model Checking Using Algebraic Geometry
George S. Avrunin
Department of Mathematics, University of Massachusetts, Amherst, MA 010034515
avrunin@math.umass.edu
Abstract. In this paper, I show that methods from computational algebraic ge
ometry can be used to carry out symbolic model checking using an encoding of
Boolean sets as the common zeros of sets of polynomials. This approach could
serve as a useful supplement to symbolic model checking methods based on Or
dered Binary Decision Diagrams and may provide important theoretical insights
by bringing the powerful mathematical machinery of algebraic geometry to bear
on the model checking problem.
1 Introduction
Symbolic model checking [8, 13] with Ordered Binary Decision Diagrams (OBDDs),
or variants of OBDDs, is a widely used and successful technique for verifying properties
of concurrent systems, both hardware and software. But there are many systems for
which the OBDDs are too large to make model checking feasible and, aside from a few
results like McMillan's theorem on bounded width circuits [13] or Bryant's theorem on
integer multiplication [5], there is little theoretical guidance to indicate precisely when
