Pages that link to "Item:Q2583288"
From MaRDI portal
The following pages link to Formal verification of a generic framework to synthesize SAT-provers (Q2583288):
Displaying 15 items.
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL (Q606999) (← links)
- An approach from answer set programming to decision making in a railway interlocking system (Q740741) (← links)
- A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234) (← links)
- A logic-algebraic tool for reasoning with knowledge-based systems (Q1994361) (← links)
- Integration of formal proof into unified assurance cases with Isabelle/SACM (Q2065527) (← links)
- Formally verified tableau-based reasoners for a description logic (Q2351147) (← links)
- Linear templates of ACTL formulas with an application to SAT-based verification (Q2398494) (← links)
- Satallax: An Automatic Higher-Order Prover (Q2908482) (← links)
- (Q2979814) (← links)
- A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses (Q3100209) (← links)
- Formalization of Abstract State Transition Systems for SAT (Q3224685) (← links)
- (Q3566623) (← links)
- Conservative Retractions of Propositional Logic Theories by Means of Boolean Derivatives: Theoretical Foundations (Q3637268) (← links)
- (Q4037133) (← links)
- Satisfiability Checking of Non-clausal Formulas Using General Matings (Q5756567) (← links)