51 citations · 65 across the 9 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
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.PL2013★ 13 cited
Learning Universally Quantified Invariants of Linear Data Structures
Pranav Garg, Christof Loding, P. Madhusudan +1
We propose a new automaton model, called quantified data automata over words, that can model quantified invariants over linear data structures, and build poly-time active learning…