Gereon Kremer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Gereon Kremer has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Aina Niemetz
Stanford University
2 shared publications - Andrew Reynolds
The University of Iowa
2 shared publications - Cesare Tinelli
The University of Iowa
2 shared publications - Clark Barrett
Stanford University
2 shared publications - Mathias Preiner
Stanford University
2 shared publications - Abdalrhman Mohamed
Stanford University, Stanford, USA
1 shared publication
Latest Publications
- Open Access
- 1 August 2022
- Published by Springer Nature
- p. 95-105
Cooperating Techniques for Solving Nonlinear Real Arithmetic in the cvc5 SMT Solver (System Description)
The SMT solver solves quantifier-free nonlinear real arithmetic problems by combining the cylindrical algebraic coverings method with incremental linearization in an abstraction-refinement loop. The result is a complete algebraic decision procedure that leverages efficient heuristics for refining candidate models. Furthermore, it can be used with quantifiers, integer variables, and in combination with other theories. We describe the overall framework, individual solving techniques, and a number of implementation details. We demonstrate its effectiveness with an evaluation on the SMT-LIB benchmarks.
- 1 August 2022
- Published by Springer Nature
- p. 95-105
Open AccessCooperating Techniques for Solving Nonlinear Real Arithmetic in the cvc5 SMT Solver (System Description)
The SMT solver solves quantifier-free nonlinear real arithmetic problems by combining the cylindrical algebraic coverings method with incremental linearization in an abstraction-refinement loop. The result is a complete algebraic decision procedure that leverages efficient heuristics for refining candidate models. Furthermore, it can be used with quantifiers, integer variables, and in combination with other theories. We describe the overall framework, individual solving techniques, and a number of implementation details. We demonstrate its effectiveness with an evaluation on the SMT-LIB benchmarks.
- Top Cited PapersOpen Access
- 30 March 2022
- Published by Springer Nature
- p. 415-442
cvc5: A Versatile and Industrial-Strength SMT Solver
Cvc5 is the latest SMT solver in the cooperating validity checker series and builds on the successful code base of CVC4. This paper serves as a comprehensive system description of cvc5 ’s architectural design and highlights the major features and components introduced since CVC4 1.8. We evaluate cvc5 ’s performance on all benchmarks in SMT-LIB and provide a comparison against CVC4 and Z3.
- 30 March 2022
- Published by Springer Nature
- p. 415-442
Top Cited PapersOpen Accesscvc5: A Versatile and Industrial-Strength SMT Solver
Cvc5 is the latest SMT solver in the cooperating validity checker series and builds on the successful code base of CVC4. This paper serves as a comprehensive system description of cvc5 ’s architectural design and highlights the major features and components introduced since CVC4 1.8. We evaluate cvc5 ’s performance on all benchmarks in SMT-LIB and provide a comparison against CVC4 and Z3.
- Open Access
- 15 July 2021
- Published by Springer Nature
- p. 231-242
ddSMT 2.0: Better Delta Debugging for the SMT-LIBv2 Language and Friends
Erroneous behavior of verification back ends such as SMT solvers require effective and efficient techniques to identify, locate and fix failures of any kind. Manual analysis of large real-world inputs usually becomes infeasible due to the complex nature of these tools. Delta Debugging has emerged as a valuable technique to automatically reduce failure-inducing inputs while preserving the original erroneous behavior. We present , the successor of the delta debugger . is the current de-facto standard delta debugger for the SMT-LIBv2 language. Our tool improves and extends core concepts of and extends input language support to the entire family of SMT-LIBv2 language dialects. In addition to its ddmin-based main minimization strategy, it implements an alternative, orthogonal strategy based on hierarchical input minimization. We combine both strategies into a hybrid strategy and show that significantly improves over and other delta debugging tools for SMT-LIBv2 on real-world examples.
- 15 July 2021
- Published by Springer Nature
- p. 231-242
Open AccessddSMT 2.0: Better Delta Debugging for the SMT-LIBv2 Language and Friends
Erroneous behavior of verification back ends such as SMT solvers require effective and efficient techniques to identify, locate and fix failures of any kind. Manual analysis of large real-world inputs usually becomes infeasible due to the complex nature of these tools. Delta Debugging has emerged as a valuable technique to automatically reduce failure-inducing inputs while preserving the original erroneous behavior. We present , the successor of the delta debugger . is the current de-facto standard delta debugger for the SMT-LIBv2 language. Our tool improves and extends core concepts of and extends input language support to the entire family of SMT-LIBv2 language dialects. In addition to its ddmin-based main minimization strategy, it implements an alternative, orthogonal strategy based on hierarchical input minimization. We combine both strategies into a hybrid strategy and show that significantly improves over and other delta debugging tools for SMT-LIBv2 on real-world examples.