Follow
Thomas Dinsdale-Young
Thomas Dinsdale-Young
Aarhus University
Verified email at d-y.me.uk - Homepage
Title
Cited by
Cited by
Year
Concurrent abstract predicates
T Dinsdale-Young, M Dodds, P Gardner, MJ Parkinson, V Vafeiadis
ECOOP 2010–Object-Oriented Programming: 24th European Conference, Maribor …, 2010
3252010
Views: compositional reasoning for concurrent programs
T Dinsdale-Young, L Birkedal, P Gardner, M Parkinson, H Yang
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on principles of …, 2013
2302013
TaDA: A logic for time and data abstraction
P da Rocha Pinto, T Dinsdale-Young, P Gardner
ECOOP 2014–Object-Oriented Programming: 28th European Conference, Uppsala …, 2014
1732014
Caper Automatic Verification for Fine-Grained Concurrency
T Dinsdale-Young, P da Rocha Pinto, KJ Andersen, L Birkedal
Programming Languages and Systems: 26th European Symposium on Programming …, 2017
432017
Modular termination verification for non-blocking concurrency
P da Rocha Pinto, T Dinsdale-Young, P Gardner, J Sutherland
Programming Languages and Systems: 25th European Symposium on Programming …, 2016
432016
Afgjort: A partially synchronous finality layer for blockchains
T Dinsdale-Young, B Magri, C Matt, JB Nielsen, D Tschudi
International Conference on Security and Cryptography for Networks, 24-44, 2020
352020
A simple abstraction for complex concurrent indexes
P da Rocha Pinto, T Dinsdale-Young, M Dodds, P Gardner, ...
ACM SIGPLAN Notices 46 (10), 845-864, 2011
302011
Abstraction and refinement for local reasoning
T Dinsdale-Young, P Gardner, M Wheelhouse
Verified Software: Theories, Tools, Experiments: Third International …, 2010
282010
Steps in modular specifications for concurrent modules (invited tutorial paper)
P da Rocha Pinto, T Dinsdale-Young, P Gardner
Electronic Notes in Theoretical Computer Science 319, 3-18, 2015
172015
Theorems for free from separation logic specifications
L Birkedal, T Dinsdale-Young, A Guéneau, G Jaber, K Svendsen, ...
Proceedings of the ACM on Programming Languages 5 (ICFP), 1-29, 2021
142021
Adjunct elimination in context logic for trees
C Calcagno, T Dinsdale-Young, P Gardner
Programming Languages and Systems: 5th Asian Symposium, APLAS 2007 …, 2007
122007
A perspective on specifying and verifying concurrent modules
T Dinsdale-Young, P da Rocha Pinto, P Gardner
Journal of Logical and Algebraic Methods in Programming 98, 1-25, 2018
92018
Adjunct elimination in Context Logic for trees
C Calcagno, T Dinsdale-Young, P Gardner
Information and Computation 208 (5), 474-499, 2010
72010
Abstract data and local reasoning
T Dinsdale-Young
Imperial College London, 2011
52011
Verifying a concurrent data-structure from the Dartino Framework in Iris
M Krogh-Jespersen, T Dinsdale-Young, L Birkedal
22016
Locality refinement
T Dinsdale-Young, P Gardner, M Wheelhouse
Department of Computing, Imperial College London, 2010
22010
Adjunct elimination in context logic
T Dinsdale-Young
Master's thesis, Imperial College, London, 2006
22006
Steps in Modular Specifications for Concurrent Modules:(Invited Tutorial Paper)
PDR Pinto, T Dinsdale-Young, P Gardner
Electronic Notes in Theoretical Computer Science 319, 3-18, 2015
12015
Views: Compositional reasoning for concurrent programs (draft extended version)
T Dinsdale-Young, L Birkedal, P Gardner, MJ Parkinson, H Yang
Online at http://sites. google. com/site/viewsmodel, 2012
12012
Decidability of context logic
C Calcagno, T Dinsdale-Young, P Gardner
Submitted, 2009
12009
The system can't perform the operation now. Try again later.
Articles 1–20