26 citations · 74 across the 12 of their papers we have counts for
14 papers
Languages with Decidable Learning: A Meta-theorem
Paul Krogmeier, P. Madhusudan
We study expression learning problems with syntactic restrictions and introduce the class of finite-aspect checkable languages to characterize symbolic languages that admit decidab…
Learning Formulas in Finite Variable Logics
Paul Krogmeier, P. Madhusudan
We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such proble…
Model-Guided Synthesis of Inductive Lemmas for FOL with Least Fixpoints
Adithya Murali, Lucas Peña, Eion Blanchard +2
Recursively defined linked data structures embedded in a pointer-based heap and their properties are naturally expressed in pure first-order logic with least fixpoint definitions (…
A First-Order Logic with Frames
Adithya Murali, Lucas Peña, Christof Löding +1
We propose a novel logic, called Frame Logic (FL), that extends first-order logic (with recursive definitions) using a construct Sp(.) that captures the implicit supports of formul…
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…