New developments in the theory of Grobner bases and applications to formal verification

@article{Brickenstein2008NewDI,
  title={New developments in the theory of Grobner bases and applications to formal verification},
  author={Michael Brickenstein and A. Dreyer and G. Greuel and M. Wedler and Oliver Wienand},
  journal={Journal of Pure and Applied Algebra},
  year={2008},
  volume={213},
  pages={1612-1635}
}
  • Michael Brickenstein, A. Dreyer, +2 authors Oliver Wienand
  • Published 2008
  • Mathematics
  • Journal of Pure and Applied Algebra
  • We present foundational work on standard bases over rings and on Boolean Grobner bases in the framework of Boolean functions. The research was motivated by our collaboration with electrical engineers and computer scientists on problems arising from formal verification of digital circuits. In fact, algebraic modelling of formal verification problems is developed on the word-level as well as on the bit-level. The word-level model leads to Grobner basis in the polynomial ring over Z/2 n while the… CONTINUE READING
    46 Citations

    Figures and Tables from this paper.

    Network-driven Boolean Normal Forms
    • 1
    • PDF
    PolyBoRi: A framework for Gröbner-basis computations with Boolean polynomials
    • 143
    • PDF
    Gröbner-free normal forms for Boolean polynomials
    • 3
    Algorithms for Symbolic Computation and their Applications - Standard Bases over Rings and Rank Tests in Statistics
    • 12
    • PDF
    Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases
    Boolean Gröbner bases
    • 31
    The Gröbner basis of the ideal of vanishing polynomials
    • 12
    • PDF
    Gröbner bases and behaviors over finite rings
    • M. Kuijper, Kristina Schindelar
    • Mathematics, Computer Science
    • Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference
    • 2009
    • 6
    Combinations of Boolean Gröbner Bases and SAT Solvers
    • 1
    • PDF
    Solving hard instances in QF-BV combining Boolean reasoning with computer algebra
    • 2
    • PDF

    References

    SHOWING 1-10 OF 45 REFERENCES
    PolyBoRi: A framework for Gröbner-basis computations with Boolean polynomials
    • 143
    • PDF
    Slimgb: Gröbner bases with slim polynomials
    • 37
    • PDF
    Logic synthesis and verification algorithms
    • 512
    • PDF
    A new algorithm for the quantified satisfiability problem, based on zero-suppressed binary decision diagrams and memoization
    • 10
    • PDF
    Monomial representations for Gröbner bases computations
    • 25
    • PDF
    Grbner bases and products of coefficient rings
    • 11
    • PDF
    Implicit manipulation of polynomials using zero-suppressed BDDs
    • S. Minato
    • Mathematics, Computer Science
    • Proceedings the European Design and Test Conference. ED&TC 1995
    • 1995
    • 31
    • PDF
    Converting Bases with the Gröbner Walk
    • 156
    • PDF
    An introduction to Gröbner bases
    • R. Fröberg
    • Computer Science, Mathematics
    • Pure and applied mathematics
    • 1998
    • 508