What is decidable about string constraints with ReplaceAll function
<p>The theory of strings with concatenation has been widely argued as the basis of constraint solving for verifying string-manipulating programs. However, this theory is far from adequate for expressing many string constraints that are also needed in practice; for example, the use of regular c...
| Main Authors: | , , , , |
|---|---|
| Format: | Journal article |
| Published: |
Association for Computing Machinery
2017
|