![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![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
Christian Doczkal
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c13]Manuel Barbosa
, Gilles Barthe
, Christian Doczkal
, Jelle Don, Serge Fehr, Benjamin Grégoire
, Yu-Hsuan Huang, Andreas Hülsing
, Yi Lee
, Xiaodi Wu
:
Fixing and Mechanizing the Security Proof of Fiat-Shamir with Aborts and Dilithium. CRYPTO (5) 2023: 358-389 - [i1]Manuel Barbosa, Gilles Barthe, Christian Doczkal, Jelle Don, Serge Fehr, Benjamin Grégoire, Yu-Hsuan Huang, Andreas Hülsing, Yi Lee, Xiaodi Wu:
Fixing and Mechanizing the Security Proof of Fiat-Shamir with Aborts and Dilithium. IACR Cryptol. ePrint Arch. 2023: 246 (2023) - 2021
- [c12]Christian Doczkal:
A Variant of Wagner's Theorem Based on Combinatorial Hypermaps. ITP 2021: 17:1-17:17 - 2020
- [j4]Christian Doczkal
, Damien Pous:
Graph Theory in Coq: Minors, Treewidth, and Isomorphisms. J. Autom. Reason. 64(5): 795-825 (2020) - [c11]Christian Doczkal, Damien Pous:
Completeness of an axiomatization of graph isomorphism via graph rewriting in Coq. CPP 2020: 325-337
2010 – 2019
- 2018
- [j3]Christian Doczkal
, Gert Smolka:
Regular Language Representations in the Constructive Type Theory of Coq. J. Autom. Reason. 61(1-4): 521-553 (2018) - [c10]Christian Doczkal, Joachim Bard:
Completeness and decidability of converse PDL in the constructive type theory of Coq. CPP 2018: 42-52 - [c9]Christian Doczkal, Guillaume Combette, Damien Pous:
A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs. ITP 2018: 178-195 - [c8]Christian Doczkal, Damien Pous:
Treewidth-Two Graphs as a Free Algebra. MFCS 2018: 60:1-60:15 - 2016
- [b1]Christian Doczkal:
A machine-checked constructive metatheory of computation tree logic. Saarland University, 2016 - [j2]Christian Doczkal, Gert Smolka:
Completeness and Decidability Results for CTL in Constructive Type Theory. J. Autom. Reason. 56(3): 343-365 (2016) - [c7]Christian Doczkal, Gert Smolka:
Two-Way Automata in Coq. ITP 2016: 151-166 - 2015
- [c6]Gert Smolka, Steven Schäfer, Christian Doczkal:
Transfinite Constructions in Classical Type Theory. ITP 2015: 391-404 - 2014
- [c5]Christian Doczkal, Gert Smolka:
Completeness and Decidability Results for CTL in Coq. ITP 2014: 226-241 - 2013
- [c4]Christian Doczkal, Jan-Oliver Kaiser, Gert Smolka:
A Constructive Theory of Regular Languages in Coq. CPP 2013: 82-97 - 2012
- [c3]Christian Doczkal, Gert Smolka:
Constructive Completeness for Modal Logic with Transitive Closure. CPP 2012: 224-239 - 2011
- [c2]Christian Doczkal, Gert Smolka:
Constructive Formalization of Hybrid Logic with Eventualities. CPP 2011: 5-20 - 2010
- [j1]Christian Doczkal:
Strong Normalization of Moggis's Computational Metalanguage. Arch. Formal Proofs 2010 (2010)
2000 – 2009
- 2009
- [c1]Christian Doczkal, Jan Schwinghammer:
Formalizing a strong normalization proof for Moggi's computational metalanguage: a case study in Isabelle/HOL-nominal. LFMTP 2009: 57-63
Coauthor Index
![](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.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint