Model counting for recursively-defined strings

DOI10.1007/978-3-319-63390-9_21MaRDI QIDQ2164241zbMATH OpenOpenAlexFDO

Authors Minh-Thai Trinh, Duc-Hiep Chu, Joxan Jaffar

Publication date 12 August 2022

Full work available at URL https://doi.org/10.1007/978-3-319-63390-9_21

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Computational aspects of satisfiability (68R07) Algorithms on strings (68W32)

Recommendations

• Automata-based model counting for string constraints
• Progressive reasoning over recursively-defined strings
• Model counting: a new stategy for obtaining good bounds
• A new probabilistic algorithm for approximate model counting
• An efficient SMT solver for string constraints

Cited in

(5)

• Automata-based model counting for string constraints
• Dashed strings for string constraint solving
• Progressive reasoning over recursively-defined strings
• Model Checking for String Problems
• On the satisfiability of context-free string constraints with subword-ordering

This page was built for publication: Model counting for recursively-defined strings

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