Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Watch a 25-minute conference talk from POPL 2018 exploring the decidability of string constraints with the ReplaceAll function. Discover how researchers from universities in the UK and China investigate the theoretical foundations of string constraint solving, particularly focusing on the string-replace function and regular constraints. Learn about the importance of these constraints for analyzing JavaScript and HTML5 applications against cross-site scripting vulnerabilities. Understand why straight-line restrictions are necessary for decidability and how the researchers developed a modular, automata-theoretic approach for solving these constraints. Examine the maximal decidable subclass of straight-line fragments with string-replace and regular constraints, along with key undecidability results when variables are allowed in pattern parameters or length constraints are permitted.
