Twinning Automata and Regular Expressions for String Static Analysis
Authors: L. Negrini, V. Arceri, P. Ferrara, A. CortesiOnline conference, January 17-19, 2021
Conference paper
Abstract
In this paper we formalize TARSIS, a new abstract domain based on the abstract interpretation theory that approximates string values through finite state automata. The main novelty of TARSIS is that it works over an alphabet of strings instead of single characters. On the one hand, such an approach requires a more complex and refined definition of the widening operator, and the abstract semantics of string operators. On the other hand, it is in position to obtain strictly more precise results than state-of-the-art approaches. We implemented a prototype of TARSIS, and we applied it to some case studies taken from some of the most popular Java libraries manipulating string values. The experimental results confirm that TARSIS is in position to obtain strictly more precise results than existing analyses.
| Manuscript: | |
| Conference talk: | Talk @ VMCAI 2021 |
| Associated project: | Tarsis |
| Conference page: | Link |
| Springer page: | Link |