13 citations · 33 across the 9 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2018
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…
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…