Automata modulo theories
L D'Antoni, M Veanes - Communications of the ACM, 2021 - dl.acm.org
Automata modulo theories Page 1 86 COMMUNICATIONS OF THE ACM | MAY 2021 | VOL. 64
| NO. 5 review articles IMA GE B Y NA TA SH/SHUTTERS T OCK FINITE AUTOMATA ARE one …
| NO. 5 review articles IMA GE B Y NA TA SH/SHUTTERS T OCK FINITE AUTOMATA ARE one …
Rozzle: De-cloaking internet malware
JavaScript-based malware attacks have increased in recent years and currently represent a
signicant threat to the use of desktop computers, smartphones, and tablets. While static and …
signicant threat to the use of desktop computers, smartphones, and tablets. While static and …
The power of symbolic automata and transducers
L D'Antoni, M Veanes - … , CAV 2017, Heidelberg, Germany, July 24-28 …, 2017 - Springer
Symbolic automata and transducers extend finite automata and transducers by allowing
transitions to carry predicates and functions over rich alphabet theories, such as linear …
transitions to carry predicates and functions over rich alphabet theories, such as linear …
Minimization of symbolic automata
L D'Antoni, M Veanes - Proceedings of the 41st ACM SIGPLAN-SIGACT …, 2014 - dl.acm.org
Symbolic Automata extend classical automata by using symbolic alphabets instead of finite
ones. Most of the classical automata algorithms rely on the alphabet being finite, and …
ones. Most of the classical automata algorithms rely on the alphabet being finite, and …
Path sensitive static analysis of web applications for remote code execution vulnerability detection
Y Zheng, X Zhang - 2013 35th International Conference on …, 2013 - ieeexplore.ieee.org
Remote code execution (RCE) attacks are one of the most prominent security threats for web
applications. It is a special kind of cross-site-scripting (XSS) attack that allows client inputs to …
applications. It is a special kind of cross-site-scripting (XSS) attack that allows client inputs to …
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 …
It has numerous applications including automatic detection of cross-site scripting, and …
String solving with word equations and transducers: towards a logic for analysing mutation XSS
We study the fundamental issue of decidability of satisfiability over string logics with
concatenations and finite-state transducers as atomic operations. Although restricting to one …
concatenations and finite-state transducers as atomic operations. Although restricting to one …
Model learning: a survey of foundations, tools and applications
Software systems are present all around us and playing their vital roles in our daily life. The
correct functioning of these systems is of prime concern. In addition to classical testing …
correct functioning of these systems is of prime concern. In addition to classical testing …
Solving string constraints with lengths by stabilization
We present a new algorithm for solving string constraints. The algorithm builds upon a
recent method for solving word equations and regular constraints that interprets string …
recent method for solving word equations and regular constraints that interprets string …
Regular programming for quantitative properties of data streams
We propose quantitative regular expressions (QREs) as a high-level programming
abstraction for specifying complex numerical queries over data streams in a modular way …
abstraction for specifying complex numerical queries over data streams in a modular way …