SAT-based automated completion for reachability analysis

DOI10.1007/978-3-031-71112-1_6MaRDI QIDQ6666788zbMATH OpenFDO

Authors Yohan Boichut, Vincent Hugot, Adrien Boiret

Publication date 20 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-71112-1_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A theoretical limit for safety verification techniques with regular fix-point computations
• Approximation-based tree regular model-checking
• Characterizing conclusive approximations by logical formulae
• Completeness of tree automata completion
• Equational approximations for tree automata completion
• Finer Is Better: Abstraction Refinement for Rewriting Approximations
• scientific article; zbMATH DE number 1614701 (Why is no real title available?)
• PySAT: a Python toolkit for prototyping with SAT oracles
• Reachability analysis of term rewriting systems with Timbuk
• Reachability analysis over term rewriting systems
• Theory and Applications of Satisfiability Testing
• Verifying higher-order functions with tree automata

This page was built for publication: SAT-based automated completion for reachability analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6666788)