26 citations · 26 across the 2 of their papers we have counts for
2 papers
cs.PL2013
Quantified Data Automata on Skinny Trees: an Abstract Domain for Lists
Pranav Garg, P. Madhusudan, Gennaro Parlato
We propose a new approach to heap analysis through an abstract domain of automata, called automatic shapes. The abstract domain uses a particular kind of automata, called quantifie…
cs.LO2012★ 26 cited
Sequentializing Parameterized Programs
Salvatore La Torre, P. Madhusudan, Gennaro Parlato
We exhibit assertion-preserving (reachability preserving) transformations from parameterized concurrent shared-memory programs, under a k-round scheduling of processes, to sequenti…