# 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} }

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

#### Figures and Tables from this paper.

46 Citations

Network-driven Boolean Normal Forms

- Mathematics, Computer Science
- Verification over discrete-continuous boundaries
- 2010

1- PDF

PolyBoRi: A framework for Gröbner-basis computations with Boolean polynomials

- Mathematics, Computer Science
- J. Symb. Comput.
- 2009

143- PDF

Algorithms for Symbolic Computation and their Applications - Standard Bases over Rings and Rank Tests in Statistics

- Mathematics
- 2011

12- PDF

The Gröbner basis of the ideal of vanishing polynomials

- Mathematics, Computer Science
- J. Symb. Comput.
- 2011

12- PDF

Gröbner bases and behaviors over finite rings

- Mathematics, Computer Science
- Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference
- 2009

6

Solving hard instances in QF-BV combining Boolean reasoning with computer algebra

- Mathematics, Computer Science
- Algorithms and Applications for Next Generation SAT Solvers
- 2009

2- PDF

#### References

SHOWING 1-10 OF 45 REFERENCES

PolyBoRi: A framework for Gröbner-basis computations with Boolean polynomials

- Mathematics, Computer Science
- J. Symb. Comput.
- 2009

143- PDF

A new algorithm for the quantified satisfiability problem, based on zero-suppressed binary decision diagrams and memoization

- Computer Science, Mathematics
- 2005

10- PDF

Monomial representations for Gröbner bases computations

- Computer Science, Mathematics
- ISSAC '98
- 1998

25- PDF

Implicit manipulation of polynomials using zero-suppressed BDDs

- Mathematics, Computer Science
- Proceedings the European Design and Test Conference. ED&TC 1995
- 1995

31- PDF