Symbolic Model Checking is a technique for checking certain properties of a finite state model of a computer system. The most widely used symbolic representation is based on Ordered Binary Decision Diagrams. In , G. Avrunin showed how computational geometry and Gröbner basis techniques may be used for symbolic model checking. The present work investigates the details of this approach, and its practicality, using theoretical means and experiments based on a prototype implementation.
0984: Computer science
Identifier / keyword
Applied sciences, Pure sciences, Algebraic geometry, Computational algebraic geometry, Finite-state verification, Symbolic model checking
Symbolic model checking using algebraic geometry
DAI-B 64/01, Dissertation Abstracts International
Place of publication
Country of publication
University of Massachusetts Amherst
United States -- Massachusetts
Dissertations & Theses
ProQuest document ID
Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works.