3 papers
cs.PL2026
Foundational Constraint Solving for Expressive Refinement Typing
Jam Kabeer Ali Khan, Petros Markopoulos, Nico Lehmann +1
SMT-based program verifiers are hamstrung by two problems: expressiveness, because predictable verification restricts to the boundaries of SMT decidability, and trust, because the…
quant-ph2026
Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded Assertions
Gilles Barthe, Minbo Gao, Jam Kabeer Ali Khan +7
We present sound and complete relational program logics for infinite-dimensional quantum and classical-quantum programs. The logics model assertions as self-adjoint unbounded linea…
cs.LG2025
Selecting for Less Discriminatory Algorithms: A Relational Search Framework for Navigating Fairness-Accuracy Trade-offs in Practice
Hana Samad, Michael Akinwumi, Jameel Khan +2
As machine learning models are increasingly embedded into society through high-stakes decision-making, selecting the right algorithm for a given task, audience, and sector presents…