Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID14th ITP 2023: Białystok, Poland
- Adam Naumowicz
, René Thiemann:
14th International Conference on Interactive Theorem Proving, ITP 2023, July 31 to August 4, 2023, Białystok, Poland. LIPIcs 268, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-284-6 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:10
- Angeliki Koutsoukou-Argyraki:
Formalisation of Additive Combinatorics in Isabelle/HOL (Invited Talk). 1:1-1:2 - Robbert Krebbers:
Interactive and Automated Proofs in Modal Separation Logic (Invited Talk). 2:1-2:1 - Mohammad Abdulaziz, Christoph Madlener:
A Formal Analysis of RANKING. 3:1-3:18 - Oskar Abrahamsson, Magnus O. Myreen:
Fast, Verified Computation for Candle. 4:1-4:17 - Beniamino Accattoli, Horace Blanc, Claudio Sacerdoti Coen:
Formalizing Functions as Processes. 5:1-5:21 - David Kurniadi Angdinata, Junyan Xu:
An Elementary Formal Proof of the Group Law on Weierstrass Elliptic Curves in Any Characteristic. 6:1-6:19 - Jeremy Avigad, Lior Goldberg, David Levit, Yoav Seginer, Alon Titelman:
A Proof-Producing Compiler for Blockchain Applications. 7:1-7:19 - Roger Bosman, Georgios Karachalias, Tom Schrijvers:
No Unification Variable Left Behind: Fully Grounding Type Inference for the HDM System. 8:1-8:18 - Mario Carneiro, Chad E. Brown, Josef Urban:
Automated Theorem Proving for Metamath. 9:1-9:19 - Mario Carneiro:
Reimplementing Mizar in Rust. 10:1-10:18 - Luís Cruz-Filipe, Fabrizio Montesi:
Now It Compiles! Certified Automatic Repair of Uncompilable Protocols. 11:1-11:19 - Ana de Almeida Borges, Annalí Casanueva Artís, Jean-Rémy Falleri, Emilio Jesús Gallego Arias, Érik Martin-Dorel, Karl Palmskog, Alexander Serebrenik, Théo Zimmermann:
Lessons for Interactive Theorem Proving Researchers from a Survey of Coq Users. 12:1-12:18 - María Inés de Frutos-Fernández:
Formalizing Norm Extensions and Applications to Number Theory. 13:1-13:18 - Lawrence Dunn, Val Tannen, Steve Zdancewic:
Tealeaves: Structured Monads for Generic First-Order Abstract Syntax Infrastructure. 14:1-14:20 - Martin Dvorak, Jasmin Blanchette:
Closure Properties of General Grammars - Formally Verified. 15:1-15:16 - Jarl G. Taxerås Flaten:
Formalising Yoneda Ext in Univalent Foundations. 16:1-16:17 - Simon Guilloud, Sankalp Gambhir, Viktor Kuncak:
LISA - A Modern Proof System. 17:1-17:19 - Michikazu Hirata, Yasuhiko Minamide, Tetsuya Sato:
Semantic Foundations of Higher-Order Probabilistic Programs in Isabelle/HOL. 18:1-18:18 - Jan Jakubuv, Karel Chvalovský, Zarathustra Amadeus Goertzel, Cezary Kaliszyk, Mirek Olsák, Bartosz Piotrowski, Stephan Schulz, Martin Suda, Josef Urban:
MizAR 60 for Mizar 50. 19:1-19:22 - Philipp Joram, Niccolò Veltri:
Constructive Final Semantics of Finite Bags. 20:1-20:19 - Dominique Larchey-Wendling, Jean-François Monin:
Proof Pearl: Faithful Computation and Extraction of μ-Recursive Algorithms in Coq. 21:1-21:17 - Amelia Livingston:
Group Cohomology in the Lean Community Library. 22:1-22:17 - Oliver Nash:
A Formalisation of Gallagher's Ergodic Theorem. 23:1-23:16 - Wojciech Nawrocki, Edward W. Ayers, Gabriel Ebner:
An Extensible User Interface for Lean 4. 24:1-24:20 - Pierre Pomeret-Coquot, Hélène Fargier, Érik Martin-Dorel:
Bel-Games: A Formal Theory of Games of Incomplete Information Based on Belief Functions in the Coq Proof Assistant. 25:1-25:19 - Tom Reichel, R. Wesley Henderson, Andrew Touchet, Andrew Gardner, Talia Ringer:
Proof Repair Infrastructure for Supervised Models: Building a Large Proof Repair Dataset. 26:1-26:20 - Chengsong Tan, Christian Urban:
POSIX Lexing with Bitcoded Derivatives. 27:1-27:18 - Dawit Legesse Tirore, Jesper Bengtson, Marco Carbone:
A Sound and Complete Projection for Global Types. 28:1-28:19 - Balázs Tóth, Tobias Nipkow:
Real-Time Double-Ended Queue Verified (Proof Pearl). 29:1-29:18 - Niels van der Weide, Deivid Vale, Cynthia Kop:
Certifying Higher-Order Polynomial Interpretations. 30:1-30:20 - Niels F. W. Voorneveld:
Slice Nondeterminism. 31:1-31:19 - Qinshi Wang, Mengying Pan, Shengyi Wang, Ryan Doenges, Lennart Beringer, Andrew W. Appel:
Foundational Verification of Stateful P4 Packet Processing. 32:1-32:20 - Yiming Xu, Michael Norrish:
Dependently Sorted Theorem Proving for Mathematical Foundations. 33:1-33:18 - Akihisa Yamada, Jérémy Dubut:
Formalizing Results on Directed Sets in Isabelle/HOL (Proof Pearl). 34:1-34:13 - Jujian Zhang:
Formalising the Proj Construction in Lean. 35:1-35:17 - Alex J. Best, Christopher Birkbeck, Riccardo Brasca, Eric Rodriguez Boidi:
Fermat's Last Theorem for Regular Primes (Short Paper). 36:1-36:8 - Adam Grabowski, Artur Kornilowicz:
Implementing More Explicit Definitional Expansions in Mizar (Short Paper). 37:1-37:8 - Christina Kohl, Aart Middeldorp:
Formalizing Almost Development Closed Critical Pairs (Short Paper). 38:1-38:8
a service of 
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 2024-05-15 21:45 CEST 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:
