Symbolic model checking using algebraic geometry

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1102, Issue , 1996, Pages 26-37

  Avrunin, George S ^a  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BINARY DECISION DIAGRAMS; COMPUTATIONAL GEOMETRY; COMPUTER AIDED ANALYSIS; GEOMETRY; MACHINERY;

ALGEBRAIC GEOMETRY; COMMON ZEROS; COMPUTATIONAL ALGEBRAIC GEOMETRY; MODEL CHECKING PROBLEM; ORDERED BINARY DECISION DIAGRAMS; SYMBOLIC MODEL CHECKING;

MODEL CHECKING;

EID: 84903554029     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61474-5_55     Document Type: Conference Paper

References (13)

1. W. W. Adams and E Loustaunau. An Introduction to Grrbner Bases, volume 3 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 1994.
2. D. Bayer and M. Stillman. Macaulay: A System for Computation in Algebraic Geometry and Commutative Algebra. Source and object code available for Unix and Macintosh computers. Contact the authors, or download from math.harvard.edu via anonymous ftp., 1982-1994.
3. D. Bayer and M. Stillman. A criterion for detecting m-regularity. Invent. Math., 87:1-11, 1987.
4. T. Becker and V. Weispfenning. Gröbner Bases, volume 141 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1993.
5. R.E. Bryant. On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. Comput., 40(2):205-213, Feb. 1991.
6. B. Buchberger. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes naeh einem nulldimensionalen Polynomideal. PhD thesis, University of Innsbruck, 1965.
7. B. Buchberger. Gröbner bases: An algorithmic method in polynomial ideal theory. In N. K. Bose, editor, Multidimensional Systems Theory, pages 184-232. D. Reidel, 1985.
8. J. Burch, E. Clarke, K. McMillan, D. Dill, and L. Hwang. Symbolic model checking: 102o states and beyond. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 428-439, 1990.
9. D. Cox, J. Little, and D. O'Shea. Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics. Springer-Verlag, New York, 1992.
10. E Gritzmarm and B. Sturmfels. Mirtkowski addition of polytopes: Computational complexity and applications to Gröbner bases. SIAM Journal on Discrete Mathematics, 6(2):246-269, 1993.
11. R. Hartshorne. Algebraic Geometry, volume 52 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1977.
12. E. Mayr and A. Meyer. The complexity of the word problem for commutative semigroups and polynomial ideals. Adv. in Math., 1982.
13. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Boston, 1993.