26 citations · 74 across the 12 of their papers we have counts for
3 papers · 1 filter
Reachability under Contextual Locking
Remi Bonnet, Rohit Chadha, Mahesh Viswanathan +1
The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of the progr…
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…
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…