Dr. Daniel Wright's Homepage

I study how time and causality work in highly optimised concurrent programs, and how to represent runtime behaviour using unoptimised source code. You can read my thesis if you want. My DBLP page lists my publications and might be more up-to-date than my site.

This page is still under construction.

I'm currently looking for work, especially postdoc or industrial research positions in weak memory concurrency. My CV is available here.

You can email me at daniel.w.0108@gmail.com

If you're looking for a list of publications, here they are:

• Owicki-Gries Reasoning for C11 Programs with Relaxed Dependencies

  Wright, D., Batty, M., Dongol, B. (2021). In: Huisman, M., Păsăreanu, C., Zhan, N. (eds) Formal Methods. FM 2021. Lecture Notes in Computer Science(), vol 13047.

• Modular Relaxed Dependencies in Weak Memory Concurrency

  Paviotti, M., Cooksey, S., Paradis, A., Wright, D., Owens, S., Batty, M. (2020). In: Müller, P. (eds) Programming Languages and Systems. ESOP 2020. Lecture Notes in Computer Science(), vol 12075.

• Modular Relaxed Dependencies: A new approach to the Out-Of-Thin-Air Problem.

  Batty, M., Cooksey, S., Owens, S., Paradis, A., Paviotti, M., Wright, D. (2019). ISO WG1 draft proposal D1780R0.