String solving with word equations and transducers: towards a logic for analysing mutation XSS
From MaRDI portal
Publication:2828250
DOI10.1145/2837614.2837641zbMath1347.03060arXiv1511.01633OpenAlexW2295791966MaRDI QIDQ2828250
Pablo Barceló, Anthony Widjaja Lin
Publication date: 24 October 2016
Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.01633
Formal languages and automata (68Q45) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Internet topics (68M11)
Related Items
An SMT solver for regular expressions and linear arithmetic over string length, Word equations in the context of string solving, Towards more efficient methods for solving regular-expression heavy string constraints, A solver for arrays with concatenation, Word equations in synergy with regular constraints, Unnamed Item, Chain-Free String Constraints, Unnamed Item, Unnamed Item, Monadic decomposition in integer linear arithmetic, A decision procedure for string to code point conversion
