Analyzing web applications requires reasoning about strings and non-strings cohesively.
Existing string solvers either ignore non-string program behavior or support limited set of …

Symbolic PathFinder (SPF) is a software analysis tool that combines symbolic execution with
model checking for automated test case generation and error detection in Java bytecode …

Motivated by the vulnerability analysis of web programs which work on string inputs, we
present S3, a new symbolic string solver. Our solver employs a new algorithm for a …

An increasing number of applications in verification and security rely on or could benefit from
automatic solvers that can check the satisfiability of constraints over a rich set of data types …

Web applications often use special string-manipulating sanitizers on untrusted user data, but
it is difficult to reason manually about the behavior of these functions, leading to errors. For …

Finite automata and finite transducers are used in a wide range of applications in software
engineering, from regular expressions to specification languages. We extend these classic …

Most common vulnerabilities in Web applications are due to string manipulation errors in
input validation and sanitization code. String constraint solvers are essential components of …

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 …

We present an automated approach for detecting and quantifying side channels in Java
programs, which uses symbolic execution, string analysis and model counting to compute …

An increasing number of applications in verification and security rely on or could benefit from
automatic solvers that can check the satisfiability of constraints over a diverse set of data …