| PolyBoRi: A framework for Gröbner-basis computations with Boolean polynomials M Brickenstein, A Dreyer Journal of Symbolic Computation 44 (9), 1326-1345, 2009 | 214 | 2009 |
| New developments in the theory of Gröbner bases and applications to formal verification M Brickenstein, A Dreyer, GM Greuel, M Wedler, O Wienand Journal of Pure and Applied Algebra 213 (8), 1612-1635, 2009 | 68 | 2009 |
| Stable: A new qf-bv smt solver for hard verification problems combining boolean reasoning with computer algebra E Pavlenko, M Wedler, D Stoffel, W Kunz, A Dreyer, F Seelisch, ... 2011 Design, Automation & Test in Europe, 1-6, 2011 | 61 | 2011 |
| Interval analysis of analog circuits with component tolerances A Dreyer Shaker, 2005 | 32 | 2005 |
| Interval analysis of linear analog circuits A Dreyer 12th GAMM-IMACS International Symposium on Scientific Computing, Computer …, 2006 | 15 | 2006 |
| Gröbner-free normal forms for Boolean polynomials M Brickenstein, A Dreyer Journal of Symbolic Computation 48, 37-53, 2013 | 13* | 2013 |
| POLYBORI: A Gröbner basis framework for Boolean polynomials M Brickenstein, A Dreyer | 9 | 2007 |
| Combination of symbolic and interval-numeric methods for analysis of analog circuits A Dreyer Proc. 8th International Workshop on Symbolic Methods and Applications in …, 2004 | 9 | 2004 |
| Analog Insydes 2.1 Manual J Broz, A Dreyer, T Halfmann, E Hennig, M Thole, T Wichmann Fraunhofer ITWM, Kaiserslautern, 2005 | 7 | 2005 |
| Interval methods for analog circuits A Dreyer | 6 | 2006 |
| Primary decomposition of modules A Dreyer Diplomarbeit, Kaiserslautern, 2001 | 6 | 2001 |
| Automatic Nonlinear Behavioral Model Generation using Sequential Equation Structure R Sommer, D Platte, J Broz, A Dreyer, T Halfmann, E Barke International Workshop on Symbolic Methods and Applications to Circuit and …, 2006 | 5 | 2006 |
| Analog Insydes-Release 2.1 Manual J Broz, A Dreyer, T Halfmann, E Hennig, M Thole, T Wichmann Fraunhofer Institute for Industrial Mathematics (ITWM), Kaiserslautern, Germany, 0 | 5 | |
| Improving Gröbner-based Clause Learning for SAT Solving Industrial-sized Boolean Problems TH Nguyen, A Dreyer Young Researcher Symposium (YRS) 2013, 72, 2013 | 3 | 2013 |
| Proof logging for computer algebra based smt solving O Marx, M Wedler, D Stoffel, W Kunz, A Dreyer 2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), 677-684, 2013 | 2 | 2013 |
| Network-driven Boolean normal forms M Brickenstein, A Dreyer Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2010 | 2 | 2010 |
| Fast and Robust Symbolic Model Order Reduction with Analog Insydes M Hauser, C Salzig, A Dreyer Computer Algebra in Scientific Computing: 13th International Workshop, CASC …, 2011 | 1 | 2011 |
| Preprocessing polynomials for arithmetic reasoning within the SMT-Solver STABLE A Dreyer, O Marx, E Pavlenko, M Wedler, D Stoffel, W Kunz, G Greuel Seventh international workshop on constraints in formal verification (CFV’11 …, 2011 | 1 | 2011 |
| Solving hard instances in QF-BV combining Boolean reasoning with computer algebra M Wedler, E Pavlenko, A Dreyer, F Seelisch, D Stoffel, GM Greuel, ... Schloss-Dagstuhl-Leibniz Zentrum für Informatik, 2010 | 1 | 2010 |
| Resolving parameter dependences for interval analysis of linear analog circuits A Dreyer Proceedings of the 9th International Workshop on Symbolic Methods and …, 2006 | 1 | 2006 |
