default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13th ITP 2022: Haifa, Israel
- June Andronick, Leonardo de Moura
:
13th International Conference on Interactive Theorem Proving, ITP 2022, Haifa, Israel, August 7-10, 2022. LIPIcs 237, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-252-5 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:10
- Amy P. Felty:
Modelling and Verifying Properties of Biological Neural Networks (Invited Talk). 1:1-1:2 - Bohua Zhan:
User Interface Design in the HolPy Theorem Prover (Invited Talk). 2:1-2:1 - Oskar Abrahamsson, Magnus O. Myreen, Ramana Kumar, Thomas Sewell:
Candle: A Verified Implementation of HOL Light. 3:1-3:17 - Anne Baanen:
Use and Abuse of Instance Parameters in the Lean Mathematical Library. 4:1-4:20 - Jagadish Bapanapally, Ruben Gamboa:
A Complete, Mechanically-Verified Proof of the Banach-Tarski Theorem in ACL2(R). 5:1-5:15 - Heiko Becker, Mohit Tekriwal, Eva Darulova, Anastasia Volkova, Jean-Baptiste Jeannin:
Dandelion: Certified Approximations of Elementary Functions. 6:1-6:19 - Malgorzata Biernacka, Witold Charatonik, Tomasz Drab:
The Zoo of Lambda-Calculus Reduction Strategies, And Coq. 7:1-7:19 - Martin Desharnais, Petar Vukmirovic, Jasmin Blanchette, Makarius Wenzel:
Seventeen Provers Under the Hammer. 8:1-8:18 - Yaël Dillies, Bhavik Mehta:
Formalising Szemerédi's Regularity Lemma in Lean. 9:1-9:19 - Frédéric Dupuis, Robert Y. Lewis, Heather Macbeth:
Formalized functional analysis with semilinear maps. 10:1-10:19 - Chelsea Edmonds, Lawrence C. Paulson:
Formalising Fisher's Inequality: Formal Linear Algebraic Proof Techniques in Combinatorics. 11:1-11:19 - Yannick Forster, Fabian Kunze, Nils Lauermann:
Synthetic Kolmogorov Complexity in Coq. 12:1-12:19 - Asta Halkjær From, Frederik Krogsdal Jacobsen:
Verifying a Sequent Calculus Prover for First-Order Logic with Functions in Isabelle/HOL. 13:1-13:22 - María Inés de Frutos-Fernández:
Formalizing the Ring of Adèles of a Global Field. 14:1-14:18 - Arve Gengelbach, Johannes Åman Pohjola:
A Verified Cyclicity Checker: For Theories with Overloaded Constants. 15:1-15:18 - Zarathustra Amadeus Goertzel, Jan Jakubuv, Cezary Kaliszyk, Miroslav Olsák, Jelle Piepenbrock, Josef Urban:
The Isabelle ENIGMA. 16:1-16:21 - Jason Gross, Andres Erbsen, Jade Philipoom, Miraya Poddar-Agrawal, Adam Chlipala:
Accelerating Verified-Compiler Development with a Verified Rewriting Engine. 17:1-17:18 - Jason Gross, Théo Zimmermann, Miraya Poddar-Agrawal, Adam Chlipala:
Automatic Test-Case Reduction in Proof Assistants: A Case Study in Coq. 18:1-18:18 - Johannes Hostert, Andrej Dudenhefner, Dominik Kirst:
Undecidability of Dyadic First-Order Logic in Coq. 19:1-19:19 - Hrutvik Kanabar, Anthony C. J. Fox, Magnus O. Myreen:
Taming an Authoritative Armv8 ISA Specification: L3 Validation and CakeML Compiler Verification. 20:1-20:22 - Emin Karayel:
Formalization of Randomized Approximation Algorithms for Frequency Moments. 21:1-21:21 - Dominik Kirst:
Computational Back-And-Forth Arguments in Constructive Type Theory. 22:1-22:12 - Yury Kudryashov:
Formalizing the Divergence Theorem and the Cauchy Integral Formula in Lean. 23:1-23:19 - Peter Lammich:
Refinement of Parallel Algorithms down to LLVM. 24:1-24:18 - Nicolas Magaud:
Proof Pearl: Formalizing Spreads and Packings of the Smallest Projective Space PG(3, 2) Using the Coq Proof Assistant. 25:1-25:17 - Karol Pak, Cezary Kaliszyk:
Formalizing a Diophantine Representation of the Set of Prime Numbers. 26:1-26:8 - Johannes Åman Pohjola, Alejandro Gómez-Londoño, James Shaker, Michael Norrish:
Kalas: A Verified, End-To-End Compiler for a Choreographic Language. 27:1-27:18 - Jacob Prinz, G. A. Kavvos, Leonidas Lampropoulos:
Deeper Shallow Embeddings. 28:1-28:18 - Kazuhiko Sakaguchi:
Reflexive Tactics for Algebra, Revisited. 29:1-29:22 - Alley Stoughton, Carol Chen, Marco Gaboardi, Weihao Qu:
Formalizing Algorithmic Bounds in the Query Model in EasyCrypt. 30:1-30:21 - Koundinya Vajjha, Barry M. Trager, Avraham Shinnar, Vasily Pestun:
Formalization of a Stochastic Approximation Theorem. 31:1-31:18 - Jared Yeager, J. Eliot B. Moss, Michael Norrish, Philip S. Thomas:
Mechanizing Soundness of Off-Policy Evaluation. 32:1-32:20 - Bohua Zhan, Yi Lv, Shuling Wang, Gehang Zhao, Jifeng Hao, Hong Ye, Bican Xia:
Compositional Verification of Interacting Systems Using Event Monads. 33:1-33:21
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-20 23:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
