default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 34 matches
- 2021
- Andrei Popescu, Thomas Bauereiss, Peter Lammich:
Bounded-Deducibility Security (Invited Paper). ITP 2021: 3:1-3:20 - Matthias Brun, Sára Decova, Andrea Lattuada
, Dmitriy Traytel:
Verified Progress Tracking for Timely Dataflow. ITP 2021: 10:1-10:20 - Yannick Forster, Fabian Kunze, Gert Smolka, Maxi Wuttke:
A Mechanised Proof of the Time Invariance Thesis for the Weak Call-By-Value λ-Calculus. ITP 2021: 19:1-19:20 - Edward W. Ayers, Mateja Jamnik, William T. Gowers:
A Graphical User Interface Framework for Formal Verification. ITP 2021: 4:1-4:16 - Anne Baanen, Sander R. Dahmen, Ashvni Narayanan, Filippo A. E. Nuccio Mortarino Majno di Capriglio:
A Formalization of Dedekind Domains and Class Groups of Global Fields. ITP 2021: 5:1-5:19 - Seulkee Baek:
A Formally Verified Checker for First-Order Proofs. ITP 2021: 6:1-6:13 - Christoph Benzmüller, David Fuenmayor:
Value-Oriented Legal Argumentation in Isabelle/HOL. ITP 2021: 7:1-7:20 - Sophie Bernard, Cyril Cohen, Assia Mahboubi, Pierre-Yves Strub:
Unsolvability of the Quintic Formalized in Dependent Type Theory. ITP 2021: 8:1-8:18 - Frédéric Besson:
Itauto: An Extensible Intuitionistic SAT Solver. ITP 2021: 9:1-9:18 - Czeslaw Bylinski, Artur Kornilowicz, Adam Naumowicz:
Syntactic-Semantic Form of Mizar Articles. ITP 2021: 11:1-11:17 - Joshua Chen:
Homotopy Type Theory in Isabelle. ITP 2021: 12:1-12:8 - Luca Ciccone, Francesco Dagnino, Elena Zucca:
Flexible Coinduction in Agda. ITP 2021: 13:1-13:19 - Katherine Cordwell, Yong Kiam Tan, André Platzer:
A Verified Decision Procedure for Univariate Real Arithmetic with the BKR Algorithm. ITP 2021: 14:1-14:20 - Luís Cruz-Filipe, Fabrizio Montesi, Marco Peressotti:
Formalising a Turing-Complete Choreographic Language in Coq. ITP 2021: 15:1-15:18 - Christian Doczkal:
A Variant of Wagner's Theorem Based on Combinatorial Hypermaps. ITP 2021: 17:1-17:17 - Floris van Doorn:
Formalized Haar Measure. ITP 2021: 18:1-18:17 - Lennard Gäher, Fabian Kunze:
Mechanising Complexity Theory: The Cook-Levin Theorem in Coq. ITP 2021: 20:1-20:18 - Kesha Hietala, Robert Rand, Shih-Han Hung, Liyi Li, Michael Hicks:
Proving Quantum Programs Correct. ITP 2021: 21:1-21:19 - Stepan Holub, Stepán Starosta:
Formalization of Basic Combinatorics on Words. ITP 2021: 22:1-22:17 - Dominik Kirst, Marc Hermes:
Synthetic Undecidability and Incompleteness of First-Order Axiom Systems in Coq. ITP 2021: 23:1-23:20 - Meven Lennon-Bertrand:
Complete Bidirectional Typing for the Calculus of Inductive Constructions. ITP 2021: 24:1-24:19 - Andreas Lochbihler:
A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks. ITP 2021: 25:1-25:18 - Adrian De Lon, Peter Koepke, Anton Lorenzen:
A Natural Formalization of the Mutilated Checkerboard Problem in Naproche. ITP 2021: 16:1-16:11 - Marco Maggesi, Cosimo Perini Brogi:
A Formal Proof of Modal Completeness for Provability Logic. ITP 2021: 26:1-26:18 - César A. Muñoz, Mauricio Ayala-Rincón, Mariano M. Moscato, Aaron Dutle, Anthony J. Narkawicz, Ariane Alves Almeida, Andréia B. Avelar, Thiago Mendonça Ferreira Ramos:
Formal Verification of Termination Criteria for First-Order Recursive Functions. ITP 2021: 27:1-27:17 - Magnus O. Myreen:
The CakeML Project's Quest for Ever Stronger Correctness Theorems (Invited Paper). ITP 2021: 1:1-1:10 - Raja Natarajan, Suneel Sarswat, Abhishek Kr Singh:
Verified Double Sided Auctions for Financial Markets. ITP 2021: 28:1-28:18 - Pierre Nigron, Pierre-Évariste Dagand:
Reaching for the Star: Tale of a Monad in Coq. ITP 2021: 29:1-29:19 - Nadia Polikarpova:
Synthesis of Safe Pointer-Manipulating Programs (Invited Talk). ITP 2021: 2:1-2:1 - Konrad Slind:
Specifying Message Formats with Contiguity Types. ITP 2021: 30:1-30:17
skipping 4 more matches
loading more results 
failed to load more results, please try again later
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-01-24 11:42 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
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:
