default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChelsea Edmonds
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j12]John Derrick, Brijesh Dongol, Chelsea Edmonds
, Matt Griffin, Andrei Popescu, Jamie Wright:
Relative Security: (Dis)Proving Resilience Against Semantic Optimization Vulnerabilities in Isabelle/HOL. J. Autom. Reason. 69(4): 31 (2025)- [c5]Chelsea Edmonds, John Derrick, Brijesh Dongol, Gerhard Schellhorn, Heike Wehrheim:
Model Checking Buffered Durable Linearizability in CSP. iFM 2025: 120-139 - [d5]Chelsea Edmonds, Brijesh Dongol, John Derrick, Heike Wehrheim, Gerhard Schellhorn:
CSP Artifact for Model Checking Buffered Durable Linearizability. Version 1.0. Zenodo, 2025 [all versions]
- [d4]Chelsea Edmonds, Brijesh Dongol, John Derrick, Heike Wehrheim, Gerhard Schellhorn:
CSP Artifact for Model Checking Buffered Durable Linearizability. Version 1.1. Zenodo, 2025 [all versions] - [d3]Chelsea Edmonds, Brijesh Dongol, John Derrick, Heike Wehrheim, Gerhard Schellhorn:
CSP Artifact for Model Checking Buffered Durable Linearizability. Version 1.2. Zenodo, 2025 [all versions] - [d2]Chelsea Edmonds, Brijesh Dongol, John Derrick, Heike Wehrheim, Gerhard Schellhorn:
CSP Artifact for Model Checking Buffered Durable Linearizability. Version 1.3. Zenodo, 2025 [all versions] - [d1]Chelsea Edmonds, Brijesh Dongol, John Derrick, Heike Wehrheim, Gerhard Schellhorn:
CSP Artifact for Model Checking Buffered Durable Linearizability. Version 1.4. Zenodo, 2025 [all versions] - 2024
- [c4]Chelsea Edmonds, Lawrence C. Paulson:
Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma. CPP 2024: 132-146 - 2023
- [j11]Chelsea Edmonds:
General Probabilistic Techniques for Combinatorics and the Lovasz Local Lemma. Arch. Formal Proofs 2023 (2023) - [j10]Chelsea Edmonds:
Hypergraphs. Arch. Formal Proofs 2023 (2023) - [j9]Chelsea Edmonds, Lawrence C. Paulson:
Hypergraph Colouring Bounds. Arch. Formal Proofs 2023 (2023) - [j8]Chelsea Edmonds, Angeliki Koutsoukou-Argyraki, Lawrence C. Paulson:
Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL. J. Autom. Reason. 67(1): 2 (2023) - [c3]Angeliki Koutsoukou-Argyraki, Mantas Baksys, Chelsea Edmonds:
A Formalisation of the Balog-Szemerédi-Gowers Theorem in Isabelle/HOL. CPP 2023: 225-238 - [i4]Chelsea Edmonds, Lawrence C. Paulson:
Formal Probabilistic Methods for Combinatorial Structures in Isabelle/HOL. CoRR abs/2310.00513 (2023) - 2022
- [j7]Chelsea Edmonds:
Undirected Graph Theory. Arch. Formal Proofs 2022 (2022) - [j6]Chelsea Edmonds, Lawrence C. Paulson:
Fisher's Inequality: Linear Algebraic Proof Techniques for Combinatorics. Arch. Formal Proofs 2022 (2022) - [j5]Angeliki Koutsoukou-Argyraki, Mantas Baksys, Chelsea Edmonds:
The Balog-Szemerédi-Gowers Theorem. Arch. Formal Proofs 2022 (2022) - [c2]Chelsea Edmonds, Lawrence C. Paulson:
Formalising Fisher's Inequality: Formal Linear Algebraic Proof Techniques in Combinatorics. ITP 2022: 11:1-11:19 - [i3]Chelsea Edmonds, Lawrence C. Paulson:
Formalising Fisher's Inequality: Formal Linear Algebraic Proof Techniques in Combinatorics. CoRR abs/2207.02728 (2022) - [i2]Chelsea Edmonds, Angeliki Koutsoukou-Argyraki, Lawrence C. Paulson:
Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL. CoRR abs/2207.07499 (2022) - 2021
- [j4]Chelsea Edmonds, Angeliki Koutsoukou-Argyraki, Lawrence C. Paulson:
Szemerédi's Regularity Lemma. Arch. Formal Proofs 2021 (2021) - [j3]Chelsea Edmonds, Angeliki Koutsoukou-Argyraki, Lawrence C. Paulson:
Roth's Theorem on Arithmetic Progressions. Arch. Formal Proofs 2021 (2021) - [j2]Chelsea Edmonds, Lawrence C. Paulson:
Combinatorial Design Theory. Arch. Formal Proofs 2021 (2021) - [c1]Chelsea Edmonds, Lawrence C. Paulson:
A Modular First Formalisation of Combinatorial Design Theory. CICM 2021: 3-18 - [i1]Chelsea Edmonds, Lawrence C. Paulson:
A Modular First Formalisation of Combinatorial Design Theory. CoRR abs/2105.13583 (2021) - 2020
- [j1]Chelsea Edmonds:
Lucas's Theorem. Arch. Formal Proofs 2020 (2020)
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 2026-02-04 01:03 CET 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:
