26 citations · 74 across the 12 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.PL2018★ 16 cited
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,…
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…