| Concurrent abstract predicates T Dinsdale-Young, M Dodds, P Gardner, MJ Parkinson, V Vafeiadis European Conference on Object-Oriented Programming, 504-528, 2010 | 296 | 2010 |
| 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 | 195 | 2013 |
| TaDA: A logic for time and data abstraction P Rocha Pinto, T Dinsdale-Young, P Gardner European Conference on Object-Oriented Programming, 207-231, 2014 | 134 | 2014 |
| C aper T Dinsdale-Young, P Rocha Pinto, KJ Andersen, L Birkedal European Symposium on Programming, 420-447, 2017 | 34 | 2017 |
| Modular termination verification for non-blocking concurrency P Rocha Pinto, T Dinsdale-Young, P Gardner, J Sutherland European Symposium on Programming, 176-201, 2016 | 34 | 2016 |
| 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 | 29 | 2011 |
| Abstraction and refinement for local reasoning T Dinsdale-Young, P Gardner, M Wheelhouse International Conference on Verified Software: Theories, Tools, and …, 2010 | 27 | 2010 |
| 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 | 16 | 2020 |
| 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 | 16 | 2015 |
| Adjunct elimination in context logic for trees C Calcagno, T Dinsdale-Young, P Gardner Asian Symposium on Programming Languages and Systems, 255-270, 2007 | 12 | 2007 |
| 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 | 8 | 2018 |
| Adjunct elimination in Context Logic for trees C Calcagno, T Dinsdale-Young, P Gardner Information and Computation 208 (5), 474-499, 2010 | 8 | 2010 |
| Abstract data and local reasoning T Dinsdale-Young | 5 | 2010 |
| Theorems for free from separation logic specifications. L Birkedal, T Dinsdale-Young, A Guéneau, G Jaber, K Svendsen, ... Proc. ACM Program. Lang. 5 (ICFP), 1-29, 2021 | 3 | 2021 |
| Locality refinement T Dinsdale-Young, P Gardner, M Wheelhouse | 2 | 2010 |
| Adjunct elimination in context logic T Dinsdale-Young Master's thesis, Imperial College, London, 2006 | 2 | 2006 |
| Verifying a concurrent data-structure from the Dartino Framework in Iris M Krogh-Jespersen, T Dinsdale-Young, L Birkedal | 1 | 2016 |
| 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 | 1 | 2012 |
| Decidability of context logic C Calcagno, T Dinsdale-Young, P Gardner Submitted, 2009 | 1 | 2009 |
| Theorems for Free from Separation Logic Specifications N Tzevelekos, G Jaber, L Birkedal, T DINSDALE-YOUNG, A GUÉNEAU, ... | | 2021 |
Lars BirkedalDept. of Computer Science, Aarhus UniversityVerified email at cs.au.dk
