Showing cs.PLShow all
3 papers · 1 filter
cs.PL2026
Verification Modulo Tested Library Contracts
Abhishek Uppar, Omar Muhammad, Sumanth Prabhu +3
We consider the problem of verification modulo tested library contracts as a step towards automating the verification of client programs that use complex libraries. We formulate th…
cs.PL2025
Synthesizing DSLs for Few-Shot Learning
Paul Krogmeier, P. Madhusudan
We study the problem of synthesizing domain-specific languages (DSLs) for few-shot learning in symbolic domains. Given a base language and instances of few-shot learning problems,…
cs.PL2024
Predictable Verification using Intrinsic Definitions
Adithya Murali, Cody Rivera, P. Madhusudan
We propose a novel mechanism of defining data structures using intrinsic definitions that avoids recursion and instead utilizes monadic maps satisfying local conditions. We show th…