Automata-based model counting for string constraints
From MaRDI portal
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational aspects of satisfiability (68R07) Algorithms on strings (68W32)
Recommendations
Cited in
(17)- Dashed strings for string constraint solving
- On equations and first-order theory of one-relator monoids
- Model counting for recursively-defined strings
- Automata-based symbolic string analysis for vulnerability detection
- Towards more efficient methods for solving regular-expression heavy string constraints
- String solving with word equations and transducers: towards a logic for analysing mutation XSS
- Relational string verification using multi-track automata
- Relational string verification using multi-track automata
- String Analysis via Automata Manipulation with Logic Circuit Representation
- Model Checking for String Problems
- A study of symmetry breaking predicates and model counting
- Improving Symbolic Automata Learning with Concolic Execution
- scientific article; zbMATH DE number 7561688 (Why is no real title available?)
- Word equations in synergy with regular constraints
- On strings in software model checking
- Word equations in synergy with regular constraints (extended version)
- An SMT solver for regular expressions and linear arithmetic over string length
This page was built for publication: Automata-based model counting for string constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702923)
