Write a Blog >>
POPL 2021
Sun 17 - Fri 22 January 2021 Online
Mon 18 Jan 2021 17:15 - 17:30 at VMCAI - Abstract Interpretation Chair(s): Xavier Rival

In this paper we formalize and prove the soundness of 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 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 than state-of-the-art approaches. We implemented a prototype of Tarsis, and we applied it on 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.

Mon 18 Jan
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

17:00 - 17:30: Abstract InterpretationVMCAI at VMCAI
Chair(s): Xavier RivalINRIA/CNRS/ENS Paris
17:00 - 17:15
Runtime Abstract Interpretation for Numerical Accuracy and Robustness
Franck VédrineCEA LIST, Maxime JacqueminCEA LIST, France, Nikolai KosmatovThales Research and Technology, Julien SignolesCEA LIST
Media Attached
17:15 - 17:30
Twinning automata and regular expressions for string static analysis
Luca NegriniCa’ Foscari University of Venice, Julia S.r.l., Vincenzo ArceriCa’ Foscari University of Venice, Pietro FerraraUniversità Ca' Foscari, Venezia, Italy, Agostino CortesiUniversità Ca' Foscari Venezia
Media Attached