Conference paper
Static analysis for independent app developers
Lucas Brutschy, Pietro Ferrara, et al.
OOPSLA 2014
The Trapezoid Step Functions (TSF) domain is introduced in order to approximate continuous functions by a finite sequence of trapezoids, adopting linear functions to abstract the upper and the lower bounds of a continuous variable in each time slot. The lattice structure of TSF is studied, showing how to build and compute a sound abstraction of a given continuous function. Experimental results underline the effectiveness of the approach in terms of both precision and efficiency with respect to the domain of Interval Valued Step Functions (IVSF).
Lucas Brutschy, Pietro Ferrara, et al.
OOPSLA 2014
David Piorkowski, Sean Penney, et al.
VL/HCC 2017
Lucas Brutschy, Pietro Ferrara, et al.
OOPSLA 2015
Omer Tripp, Marco Pistoia, et al.
MOBILESoft 2016