8 citations · 10 across the 5 of their papers we have counts for
Showing cs.PLShow all
3 papers · 1 filter
cs.PL2013
Inference of Field-Sensitive Reachability and Cyclicity
Damiano Zanardini, Samir Genaim
In heap-based languages, knowing that a variable x points to an acyclic data structure is useful for analyzing termination: this information guarantees that the depth of the data s…
cs.PL2012★ 8 cited
Reachability-based Acyclicity Analysis by Abstract Interpretation
Samir Genaim, Damiano Zanardini
In programming languages with dynamic use of memory, such as Java, knowing that a reference variable x points to an acyclic data structure is valuable for the analysis of terminati…
cs.PL2009★ 1 cited
18th Workshop on Logic-based methods in Programming Environments (WLPE 2008)
Puri Arenas, Damiano Zanardini
This volume contains the papers presented at WLPE 2008: the 18th Workshop on Logic-based Methods in Programming Environments held on 12th December, 2008 in Udine, Italy. It was hel…