25 citations · 43 across the 5 of their papers we have counts for
5 papers
Complete first-order reasoning for functional programs
Adithya Murali, Lucas Peña, Ranjit Jhala +1
Several practical tools for automatically verifying functional programs (e.g., Liquid Haskell and Leon for Scala programs) rely on a heuristic based on unrolling recursive function…
Mechanizing Matching Logic In Coq
Péter Bereczky, Xiaohong Chen, Dániel Horpácsi +2
Matching logic is a formalism for specifying, and reasoning about, mathematical structures, using patterns and pattern matching. Growing in popularity, it has been used to define m…
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 (…
Towards a Verified Model of the Algorand Consensus Protocol in Coq
Musab A. Alturki, Jing Chen, Victor Luchangco +4
The Algorand blockchain is a secure and decentralized public ledger based on pure proof of stake rather than proof of work. At its core it is a novel consensus protocol with exactl…
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…