default search action
Kathrin Stark
Person information
- affiliation: Heriot-Watt University, UK
- affiliation (PhD 2020): Saarland University, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]Reynald Affeldt
, Alessandro Bruni, Ekaterina Komendantskaya, Natalia Slusarz, Kathrin Stark:
Taming Differentiable Logics with Coq Formalisation. ITP 2024: 4:1-4:19 - [i4]Reynald Affeldt, Alessandro Bruni, Ekaterina Komendantskaya, Natalia Slusarz, Kathrin Stark:
Taming Differentiable Logics with Coq Formalisation. CoRR abs/2403.13700 (2024) - [i3]Remi Desmartin, Omri Isac, Ekaterina Komendantskaya, Kathrin Stark, Grant O. Passmore, Guy Katz:
A Certified Proof Checker for Deep Neural Network Verification. CoRR abs/2405.10611 (2024) - 2023
- [c7]Remi Desmartin, Omri Isac, Grant O. Passmore, Kathrin Stark, Ekaterina Komendantskaya, Guy Katz:
Towards a Certified Proof Checker for Deep Neural Network Verification. LOPSTR 2023: 198-209 - [c6]Natalia Slusarz, Ekaterina Komendantskaya, Matthew L. Daggitt
Logic of Differentiable Logics: Towards a Uniform Semantics of DL. LPAR 2023: 473-493 - [i2]Natalia Slusarz, Ekaterina Komendantskaya, Matthew L. Daggitt, Robert J. Stewart, Kathrin Stark:
Logic of Differentiable Logics: Towards a Uniform Semantics of DL. CoRR abs/2303.10650 (2023) - [i1]Remi Desmartin, Omri Isac, Grant O. Passmore, Kathrin Stark, Guy Katz, Ekaterina Komendantskaya:
Towards a Certified Proof Checker for Deep Neural Network Verification. CoRR abs/2307.06299 (2023) - 2020
- [b1]Kathrin Stark:
Mechanising syntax with binders in Coq. Saarland University, Saarbrücken, Germany, 2020 - [c5]Yannick Forster
Coq à la carte: a practical approach to modular syntax with binders. CPP 2020: 186-200
2010 – 2019
- 2019
- [j1]Andreas Abel, Guillaume Allais
POPLMark reloaded: Mechanizing proofs by logical relations. J. Funct. Program. 29: e19 (2019) - [c4]Yannick Forster
Call-by-push-value in coq: operational, equational, and denotational theory. CPP 2019: 118-131 - [c3]Kathrin Stark, Steven Schäfer, Jonas Kaiser:
Autosubst 2: reasoning with multi-sorted de Bruijn terms and vector substitutions. CPP 2019: 166-180 - 2018
- [c2]Jonas Kaiser, Steven Schäfer, Kathrin Stark:
Binder aware recursion over well-scoped de Bruijn syntax. CPP 2018: 293-306 - 2016
- [c1]Gert Smolka, Kathrin Stark:
Hereditarily Finite Sets in Constructive Type Theory. ITP 2016: 374-390
Coauthor Index
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-10-07 22:17 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: