Likelihood as a Performance Gauge for Retrieval-Augmented Generation.
CoRR, 2024
Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in Coq.
Proc. ACM Program. Lang., January, 2023
Semantics for Noninterference with Interaction Trees (Artifact).
Dagstuhl Artifacts Ser., 2023
Semantics for Noninterference with Interaction Trees.
Proceedings of the 37th European Conference on Object-Oriented Programming, 2023
A type system for extracting functional specifications from memory-safe imperative programs.
,
,
,
,
,
,
,
,
,
,
Proc. ACM Program. Lang., 2021
Interaction trees: representing recursive and impure programs in Coq.
Proc. ACM Program. Lang., 2020
An equational theory for weak bisimulation via generalized parameterized coinduction.
Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2020
Interaction Trees: Representing Recursive and Impure Programs in Coq (Work In Progress).
CoRR, 2019
The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability.
CoRR, 2018
The Satisfiability of Word Equations: Decidable and Undecidable Theories.
Proceedings of the Reachability Problems - 12th International Conference, 2018
A simple soundness proof for dependent object types.
Proc. ACM Program. Lang., 2017