18 citations · 31 across the 3 of their papers we have counts for
3 papers
eess.SY2025
Looking for Signs: Reasoning About FOBNNs Using SAT
Hans-Jörg Schurr, Athénaïs Vaginay
First-Order Boolean Networks with Non-deterministic updates (FOBNN) compute a boolean transition graph representing the absence and presence of species over time. The utility of FO…
cs.LO2021★ 18 cited
Alethe: Towards a Generic SMT Proof Format (extended abstract)
Hans-Jörg Schurr, Mathias Fleury, Haniel Barbosa +1
The first iteration of the proof format used by the SMT solver veriT was presented ten years ago at the first PxTP workshop. Since then the format has matured. veriT proofs are use…
cs.LO2019★ 13 cited
Reconstructing veriT Proofs in Isabelle/HOL
Mathias Fleury, Hans-Jörg Schurr
Automated theorem provers are now commonly used within interactive theorem provers to discharge an increasingly large number of proof obligations. To maintain the trustworthiness o…