String constraints with concatenation and transducers solved efficiently
String analysis is the problem of reasoning about how strings are manipulated by a program. It has numerous applications including automatic detection of cross-site scripting, and automatic test-case generation. A popular string analysis technique includes symbolic executions, which at their core us...
Päätekijät: | Holik, L, Janku, P, Lin, A, Rümmer, P, Vojnar, T |
---|---|
Aineistotyyppi: | Journal article |
Julkaistu: |
Association for Computing Machinery
2017
|
Samankaltaisia teoksia
-
String solving with word equations and transducers: towards a logic for analysing mutation XSS
Tekijä: Lin, A, et al.
Julkaistu: (2016) -
Concatenating bipartite graphs
Tekijä: Chudnovsky, M, et al.
Julkaistu: (2022) -
Concatenated codes.
Tekijä: Forney, George David, Jr
Julkaistu: (2005) -
Concatenated codes.
Julkaistu: (2004) -
Verb concatenation in Kachin
Tekijä: Matisoff, James A.
Julkaistu: (2024)