**Research**

In simplest terms, I'm a logician working in computer science. In my research I'm interested in modular and uniform approaches to the mathematical theory of logics that are designed for a wide array of reasoning tasks, including complex systems modelling, machine learning and program verification. I'm based at UCL in the Programming Principles, Logic and Verification group, where I am a research fellow and co-investigator on the EPSRC funded 4 year project A coalgebraic framework for reductive logic and proof-search (ReLiC), working with Prof. David Pym and Prof. Alexandra Silva. At the moment I’m working on:

Coalgebraic semantics for proof-search and variants of logic programming;

Applications of many-valued logics to concurrency and consensus;

Cyclic proof theory for non-classical logics;

Mathematical foundations and metatheory for variants of bunched and separation logics.

In my PhD at UCL I was supervised by David Pym and formulated modular and uniform mathematical foundations for the family of bunched logics. I obtained my MSc in Logic at the Institute for Logic, Language and Computation in Amsterdam, and my MSci in Mathematics & Philosophy at the University Of Bristol.

**Publications & Manuscripts**S. Docherty and D. Pym. Resource Reasoning in Duality Theoretic Form: Stone-Type Dualities for Bunched and Separation Logics. TACL 2019, 2019.

**S. Docherty and D. Pym. Stone-Type Dualities for Separation Logics.**

*Logical Methods in Computer Science*, 15(1), 2019.

S. Docherty and D. Pym. Intuitionistic Layered Graph Logic: Semantics and Proof Theory.

*Logical Methods in Computer Science*, 14(4), 2018.

S. Docherty and D. Pym. A Stone-Type Duality Theorem For Separation Logic via Its Underlying Bunched Logics.

*Proc. MFPS 2017*, ENTCS 336, pp. 101—118, 2018.

S. Docherty and D. Pym. Modular Tableaux Calculi for Separation Theories.

*Proc. FoSSaCS '18,*LNCS 10803, pp 441—458, 2018

*.*

S. Docherty and D. Pym. Intuitionistic Layered Graph Logic (Abridged, for IJCAI's "Sister Conference Best Paper" Track).

*Proc. IJCAI 2017,*2017.

S. Docherty and D. Pym. Intuitionistic Layered Graph Logic.

*Proc. IJCAR 2016,*Coimbra, Portugal. LNCS 9706, pp. 469—486,

*2016.*

**Theses**

2014 S. Docherty - A Model Of Type Theory In Cubical Sets With Connections (MSc. Thesis)**Research Grants**Researcher Co-Investigator, “A coalgebraic framework for reductive logic and proof-search (ReLiC)”.

EPSRC Grant EP/S013008/1, PI: David Pym. £1.2m, Nov 2018 - Oct 2022.

**Upcoming Talks**

Resource Reasoning in Duality Theoretic Form: Stone-Type Dualities for Bunched and Separation Logics (TACL 2019)

**Past Talks**

Modular Tableaux Calculi for Separation Theories (FoSSaCS 2018) (Slides)

Modular Tableaux Calculi for Bunched Logics and Separation Theories (BCTCS 2018) (Slides)

Intuitionistic Layered Graph Logic (IJCAI 2017) (Slides)

A Stone-Type Duality Theorem for Separation Logic via its Underlying Bunched Logics (MFPS 33, 2017) (Slides)

Stone-Type Duality for Separation Logic (UCL PPLV Seminar 2017) (Slides)

A Stone Duality Primer (UCL PPLV Seminar 2017) (Slides)

Intuitionistic Layered Graph Logic (IJCAR 2016) (Slides)

A Model Of Type Theory In Cubical Sets With Connections (MSc. Viva) (Slides)**Teaching**18/19 TA for Logic and Database Theory, Directed Reading

**17/18 TA for Theory I, Logic and Database Theory**

16/17 TA for Logic and Database Theory

15/16 TA for Theory I

14/15 TA for Theory I

**Academic Service**

Conference Refereeing:** **ESOP 2019, LPAR-22, CSL 2018, IJCAR 2018, APLAS 2017, LICS 2017, FoSSaCS 2017.

Journal Refereeing: Mathematical Logic Quarterly, Journal of Logic and Computation, Journal of Cybersecurity.