40.2k citations
- Max Planck SocietyDE68 papers
- University of OxfordGB25 papers
- Centre National de la Recherche ScientifiqueFR24 papers
- Saarland UniversityDE17 papers
- University of CambridgeGB12 papers
- ETH ZurichCH11 papers
- IMDEA Software InstituteES10 papers
- Indian Institute of Technology KharagpurIN10 papers
- University of California, Los AngelesUS10 papers
- Max Planck Institute for InformaticsDE9 papers
- National University of SingaporeSG9 papers
- Newcastle UniversityGB9 papers
Showing 2023 · cs.LOShow all
2 papers · 2 filters
cs.LO2023★ 3 cited
Making Practical: Efficient Interactive Protocols for BDD Algorithms
Eszter Couillard, Philipp Czerner, Javier Esparza +1
We show that interactive protocols between a prover and a verifier, a well-known tool of complexity theory, can be used in practice to certify the correctness of automated reasonin…
cs.LO2023★ 38 cited
Outcome Logic: A Unifying Foundation for Correctness and Incorrectness Reasoning
Noam Zilberstein, Derek Dreyer, Alexandra Silva
Program logics for bug-finding (such as the recently introduced Incorrectness Logic) have framed correctness and incorrectness as dual concepts requiring different logical foundati…