Early verification of legal compliance via bounded satisfiability checking
From MaRDI portal
Publication:6535696
DOI10.1007/978-3-031-37709-9_18zbMATH Open1547.68423MaRDI QIDQ6535696
Nick Feng, Mehrdad Sabetzadeh, Marsha Chechik, Lina Marsso
Publication date: 1 February 2024
Could not fetch data.
Cites Work
- Constraint LTL satisfiability checking without automata
- SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking
- Monitoring metric first-order temporal properties
- Simplify: a theorem prover for program checking
- Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
- Efficient E-Matching for SMT Solvers
- Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
- On the complexity of integer programming
- Accelerating LTL satisfiability checking by SAT solvers
- Recursive Unsolvability of a problem of Thue
- Quantifier Instantiation Techniques for Finite Model Finding in SMT
- The Imandra Automated Reasoning System (System Description)
- Model Checking Software
- Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time
- Real-time policy enforcement with metric first-order temporal logic
- Satisfiability checking for mission-time LTL
This page was built for publication: Early verification of legal compliance via bounded satisfiability checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535696)
