26 citations · 39 across the 4 of their papers we have counts for
4 papers · 1 filter
Decidable Verification of Uninterpreted Programs
Umang Mathur, P. Madhusudan, Mahesh Viswanathan
We study the problem of completely automatically verifying uninterpreted programs---programs that work over arbitrary data models that provide an interpretation for the constants,…
Invariant Synthesis for Incomplete Verification Engines
Daniel Neider, Pranav Garg, P. Madhusudan +2
We propose a framework for synthesizing inductive invariants for incomplete verification engines, which soundly reduce logical problems in undecidable theories to decidable theorie…
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…