Precise String Analysis for JavaScript Programs Using Automata

In this paper we formalize $\mathrm{T}\mathrm{A}\mathrm{R}\mathrm{S}\mathrm{I}\mathrm{S}$, a new abstract domain based on the abstract interpretation theory that approximates string values through finite state automata. The main novelty of $\mathrm{T}\mathrm{A}\mathrm{R}\mathrm{S}\mathrm{I}\mathrm{S}$ is that it works over an alphabet of strings instead of ...$\mathrm{}\mathrm{}\mathrm{}\mathrm{}\mathrm{}\mathrm{}$$\mathrm{}\mathrm{}\mathrm{}\mathrm{}\mathrm{}\mathrm{}$

jQuery is the most popular JavaScript library but the state-of-the-art static analyzers for JavaScript applications fail to analyze simple programs that use jQuery. In this paper, we present a novel abstract string domain whose elements are simple ...

In Java, C or C++, attempts to dereference the null value result in an exception or a segmentation fault. Hence, it is important to identify those program points where this undesired behaviour might occur or prove the other program points (and possibly ...