Solving Not-Substring Constraint withFlat Abstraction
Authors:
- 12 October 2021
- book chapter
- Published by Springer Nature
- p. 305-320
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Flatten and conquer: a framework for efficient analysis of string constraints2017
- Z3-str: a z3-based string solver for web application analysis2013
- Symbolic execution for software testingCommunications of the ACM, 2013
- CVC42011
- Z3: An Efficient SMT Solver2008
- CUTEACM SIGSOFT Software Engineering Notes, 2005
- DARTACM SIGPLAN Notices, 2005
- Symbolic Model Checking without BDDs1999
- Specification and verification of concurrent systems in CESAR1982
- Symbolic execution and program testingCommunications of the ACM, 1976