31 citations · 31 across the 2 of their papers we have counts for
3 papers
Total Haskell is Reasonable Coq
Antal Spector-Zabusky, Joachim Breitner, Christine Rizkallah +1
We would like to use the Coq proof assistant to mechanically verify properties of Haskell programs. To that end, we present a tool, named hs-to-coq, that translates total Haskell p…
Incompatibility of Efficiency and Strategyproofness in the Random Assignment Setting with Indifferences
Haris Aziz, Pang Luo, Christine Rizkallah
A fundamental resource allocation setting is the random assignment problem in which agents express preferences over objects that are then randomly allocated to the agents. In 2001,…
A Framework for the Verification of Certifying Computations
Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn +1
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyond the state of the art of current automatic verification tools and usually invol…