First-order encodings in both TPTP and SMT-LIB formats are provided, together with scripts that automatically generate benchmark instances, and these benchmarks are evaluated on state-of-the-art automated theorem provers and SMT solvers.
Abstract
We introduce a new family of benchmarks for the problem of diagrammatic equivalence between circuits. Three variants of this problem are considered, ranging from basic to challenging, and benchmarks are generated for each variant. We provide first-order encodings in both TPTP and SMT-LIB formats, together with scripts that automatically generate benchmark instances, and evaluate these benchmarks on state-of-the-art automated theorem provers and SMT solvers.
This paper proposes a unified representation of individual instances of the resubstitution problem and several solvers with different runtime/quality tradeoffs that cover a broad range of use-cases in logic synthesis and formal verification.
Alan Mishchenko, Yukio Miyasaka, John Wawrzynek et al.· 0 citations
A proof checker called Nörgler is introduced that builds upon and extends the established approach pioneered by GDV and supports checking propositional, (untyped and typed) first-order, and higher-order refutations represented in TSTP.
Melanie Taprogge, H. Sariyanto, Alexander Steen· 1 citation
SMT solvers are essential in various domains, including program verification and synthesis. Although their correctness and performance have been extensively studied, performance testing for the floating-point theory remains limited, particularly for real-world queries. We propose a metamorphic testing approach that use...
This work introduces DueList, an abstraction-refinement approach geared towards list reasoning, which is implemented on top of off-the-shelf SMT solvers and extends reasoning facilities of existing solvers, allowing to conclude about the (un)satisfiability of a larger range of problems, while outperforming existing sol...
Pierre Goutagny, Aymeric Fromherz, Raphaël Monat· 0 citations
This work introduces TCS-Bench, a benchmark for evaluating Large Language Models (LLMs) on research-level Theoretical Computer Science (TCS) proof generation, and benchmarks the verifier against human-expert proof judgements on a set of target statements and generated proofs pairs.
Vincent Cohen-Addad, Dimitris Paparas, Ernest van Wijland et al.· 3 citations
We present a formalization in Dafny of the Omega Test, an algorithm used to decide the satisfiability of a system of inequalities. The implementation defines executable representations for rational numbers, linear expressions, inequalities, equalities, divisibility constraints, and systems of constraints, together with...
Ariadna Brănici-Faraon, Ștefan Ciobâcă, Diana-Elena Gratie· Electronic Proceedings in Th...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
