Theorem Proving via General Matings
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On the Evaluation of Indexing Techniques for Theorem Proving
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Fuzzing and delta-debugging SMT solvers
Proceedings of the 7th International Workshop on Satisfiability Modulo Theories
CAV'07 Proceedings of the 19th international conference on Computer aided verification
SAT modulo the theory of linear arithmetic: exact, inexact and commercial solvers
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Hard and easy distributions of SAT problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Decision procedures for SAT, SAT modulo theories and beyond. the barcelogictools
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Implementing conflict resolution
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Automated and efficient analysis of role-based access control with attributes
DBSec'12 Proceedings of the 26th Annual IFIP WG 11.3 conference on Data and Applications Security and Privacy
| Hi-index | 0.00 |
We call a theory problem a conjunction of theory literals and a theory solver any system that solves theory problems. For implementing efficient theory solvers one needs benchmark problems, and especially hard ones. Unfortunately, hard benchmarks for theory solvers are notoriously difficult to obtain. In this paper we present two tools: Hard Reality for generating theory problems from real-life problems with non-trivial boolean structure and GoRRiLA for generating random theory problems for linear arithmetic. Using GoRRiLA one can generate problems containing only a few variables, which however are difficult for all state-of-the-art solvers we tried. Such problems can be useful for debugging and evaluating solvers on small but hard problems. Using Hard Reality one can generate hard theory problems which are similar to problems found in real-life applications, for example, those taken from SMT-LIB [2].