Dashed strings for string constraint solving
From MaRDI portal
Publication:2046015
Recommendations
- Propagating \textsc{lex}, \textsc{find} and \textsc{replace} with dashed strings
- Constraint solving on bounded string variables
- Z3str2: an efficient solver for strings, regular expressions, and length constraints
- An efficient SMT solver for string constraints
- Automata-based model counting for string constraints
Cites work
- Computer Aided Verification
- Constraint programming in structural bioinformatics
- Design and implementation of bounded-length sequence variables
- scientific article; zbMATH DE number 2084728 (Why is no real title available?)
- MiniZinc with strings
- Model counting for recursively-defined strings
- Path Feasibility Analysis for String-Manipulating Programs
- Principles and Practice of Constraint Programming – CP 2004
- Principles and practice of constraint programming. 20th international conference, CP 2014, Lyon, France, September 8--12, 2014. Proceedings
- Progressive reasoning over recursively-defined strings
- Propagating \textsc{lex}, \textsc{find} and \textsc{replace} with dashed strings
- Reference abstract domains and applications to string analysis
- Symbolic execution and program testing
- Unbounded model-checking with interpolation for regular language constraints
Cited in
(7)- Propagating \textsc{lex}, \textsc{find} and \textsc{replace} with dashed strings
- Relational string abstract domains
- Twinning automata and regular expressions for string static analysis
- Simple linear string constraints
- Constraint solving on bounded string variables
- String abstract domains and their combination
- A closer look at the expressive power of logics based on word equations
Describes a project that uses
Uses Software
This page was built for publication: Dashed strings for string constraint solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2046015)
