Dashed strings for string constraint solving
From MaRDI portal
Publication:2046015
DOI10.1016/j.artint.2020.103368zbMath1504.68202OpenAlexW3083042812MaRDI QIDQ2046015
Roberto Amadini, Graeme Gange, Peter J. Stuckey
Publication date: 16 August 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2020.103368
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Algorithms on strings (68W32)
Related Items (3)
Relational string abstract domains ⋮ String abstract domains and their combination ⋮ Twinning automata and regular expressions for string static analysis
Uses Software
Cites Work
- Unnamed Item
- Principles and practice of constraint programming. 20th international conference, CP 2014, Lyon, France, September 8--12, 2014. Proceedings
- Constraint programming in structural bioinformatics
- Propagating \textsc{lex}, \textsc{find} and \textsc{replace} with dashed strings
- Design and implementation of bounded-length sequence variables
- Model counting for recursively-defined strings
- MiniZinc with strings
- Path Feasibility Analysis for String-Manipulating Programs
- Symbolic execution and program testing
- Progressive Reasoning over Recursively-Defined Strings
- Reference Abstract Domains and Applications to String Analysis
- Computer Aided Verification
- Unbounded Model-Checking with Interpolation for Regular Language Constraints
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Dashed strings for string constraint solving