![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 35 matches
- 2022
- Yannick Forster
, Fabian Kunze, Nils Lauermann:
Synthetic Kolmogorov Complexity in Coq. ITP 2022: 12:1-12:19 - Oskar Abrahamsson
, Magnus O. Myreen, Ramana Kumar, Thomas Sewell:
Candle: A Verified Implementation of HOL Light. ITP 2022: 3:1-3:17 - Anne Baanen
:
Use and Abuse of Instance Parameters in the Lean Mathematical Library. ITP 2022: 4:1-4:20 - Jagadish Bapanapally, Ruben Gamboa:
A Complete, Mechanically-Verified Proof of the Banach-Tarski Theorem in ACL2(R). ITP 2022: 5:1-5:15 - Heiko Becker, Mohit Tekriwal
, Eva Darulova, Anastasia Volkova, Jean-Baptiste Jeannin:
Dandelion: Certified Approximations of Elementary Functions. ITP 2022: 6:1-6:19 - Malgorzata Biernacka, Witold Charatonik, Tomasz Drab
:
The Zoo of Lambda-Calculus Reduction Strategies, And Coq. ITP 2022: 7:1-7:19 - Martin Desharnais, Petar Vukmirovic, Jasmin Blanchette
, Makarius Wenzel:
Seventeen Provers Under the Hammer. ITP 2022: 8:1-8:18 - Yaël Dillies, Bhavik Mehta:
Formalising Szemerédi's Regularity Lemma in Lean. ITP 2022: 9:1-9:19 - Frédéric Dupuis, Robert Y. Lewis
, Heather Macbeth
:
Formalized functional analysis with semilinear maps. ITP 2022: 10:1-10:19 - Chelsea Edmonds
, Lawrence C. Paulson:
Formalising Fisher's Inequality: Formal Linear Algebraic Proof Techniques in Combinatorics. ITP 2022: 11:1-11:19 - Amy P. Felty:
Modelling and Verifying Properties of Biological Neural Networks (Invited Talk). ITP 2022: 1:1-1:2 - Asta Halkjær From
, Frederik Krogsdal Jacobsen
:
Verifying a Sequent Calculus Prover for First-Order Logic with Functions in Isabelle/HOL. ITP 2022: 13:1-13:22 - María Inés de Frutos-Fernández
:
Formalizing the Ring of Adèles of a Global Field. ITP 2022: 14:1-14:18 - Arve Gengelbach, Johannes Åman Pohjola
:
A Verified Cyclicity Checker: For Theories with Overloaded Constants. ITP 2022: 15:1-15:18 - Zarathustra Amadeus Goertzel, Jan Jakubuv, Cezary Kaliszyk
, Miroslav Olsák, Jelle Piepenbrock, Josef Urban:
The Isabelle ENIGMA. ITP 2022: 16:1-16:21 - Jason Gross, Andres Erbsen, Jade Philipoom, Miraya Poddar-Agrawal, Adam Chlipala:
Accelerating Verified-Compiler Development with a Verified Rewriting Engine. ITP 2022: 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. ITP 2022: 18:1-18:18 - Johannes Hostert
, Andrej Dudenhefner
, Dominik Kirst:
Undecidability of Dyadic First-Order Logic in Coq. ITP 2022: 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. ITP 2022: 20:1-20:22 - Emin Karayel
:
Formalization of Randomized Approximation Algorithms for Frequency Moments. ITP 2022: 21:1-21:21 - Dominik Kirst:
Computational Back-And-Forth Arguments in Constructive Type Theory. ITP 2022: 22:1-22:12 - Yury Kudryashov:
Formalizing the Divergence Theorem and the Cauchy Integral Formula in Lean. ITP 2022: 23:1-23:19 - Peter Lammich:
Refinement of Parallel Algorithms down to LLVM. ITP 2022: 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. ITP 2022: 25:1-25:17 - Karol Pak
, Cezary Kaliszyk
:
Formalizing a Diophantine Representation of the Set of Prime Numbers. ITP 2022: 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. ITP 2022: 27:1-27:18 - Jacob Prinz, G. A. Kavvos
, Leonidas Lampropoulos:
Deeper Shallow Embeddings. ITP 2022: 28:1-28:18 - Kazuhiko Sakaguchi
:
Reflexive Tactics for Algebra, Revisited. ITP 2022: 29:1-29:22 - Alley Stoughton, Carol Chen, Marco Gaboardi
, Weihao Qu:
Formalizing Algorithmic Bounds in the Query Model in EasyCrypt. ITP 2022: 30:1-30:21 - Koundinya Vajjha, Barry M. Trager, Avraham Shinnar, Vasily Pestun:
Formalization of a Stochastic Approximation Theorem. ITP 2022: 31:1-31:18
skipping 5 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-02-17 01:49 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint