5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.PL2026
A Modular Framework for Stack-Heap and Value Abstractions (Extended Version)
Giacomo Boldini, Luca Negrini, Luca Olivieri +1
Advanced static program analysis requires reasoning on the semantics of non-trivial program behaviors (e.g., pointers and complex data structures such as lists and sets, functions,…
cs.SE2020★ 5 cited
Twinning automata and regular expressions for string static analysis
Luca Negrini, Vincenzo Arceri, Pietro Ferrara +1
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…