R. Atkey, Amortised resource analysis with separation logic, Logical Methods in Computer Science, vol.7, issue.2, p.17, 2011.

L. Birkedal, Lecture 11: CAS and spin locks, 2017.

S. Brookes and P. W. O'hearn, Concurrent separation logic, SIGLOG News, vol.3, issue.3, pp.47-65, 2016.

A. Charguéraud and F. Pottier, Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits, Journal of Automated Reasoning, 2017.

M. Clochard, J. C. Filliâtre, and A. Paskevich, How to avoid proving the absence of integer overflows, Verified Software: Theories, Tools and Experiments, vol.9593, pp.94-109, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01162661

N. A. Danielsson, Lightweight semiformal time complexity analysis for purely functional data structures, Principles of Programming Languages (POPL, 2008.

A. Guéneau, A. Charguéraud, and F. Pottier, A fistful of dollars: Formalizing asymptotic complexity claims via deductive program verification, European Symposium on Programming (ESOP), vol.10801, pp.533-560, 2018.

M. P. Haslbeck and T. Nipkow, Hoare logics for time bounds: A study in meta theory, Tools and Algorithms for Construction and Analysis of Systems (TACAS)

, Lecture Notes in Computer Science, vol.10805, pp.155-171, 2018.

J. Hoffmann, M. Marmar, and Z. Shao, Quantitative reasoning for proving lockfreedom, Logic in Computer Science (LICS), pp.124-133, 2013.

R. Jung, J. H. Jourdan, R. Krebbers, and D. Dreyer, RustBelt: securing the foundations of the Rust programming language, PACMPL, vol.2, p.34, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01633165

R. Jung, R. Krebbers, L. Birkedal, and D. Dreyer, Higher-order ghost state, International Conference on Functional Programming (ICFP), pp.256-269, 2016.

R. Jung, R. Krebbers, J. H. Jourdan, A. Bizjak, L. Birkedal et al., Iris from the ground up: A modular foundation for higher-order concurrent separation logic, Journal of Functional Programming, vol.28, p.20, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01945446

R. Jung, D. Swasey, F. Sieczkowski, K. Svendsen, A. Turon et al., Iris: monoids and invariants as an orthogonal basis for concurrent reasoning, Principles of Programming Languages (POPL), pp.637-650, 2015.

R. Krebbers, R. Jung, A. Bizjak, J. H. Jourdan, D. Dreyer et al., The essence of higher-order concurrent separation logic, European Symposium on Programming (ESOP), vol.10201, pp.696-723, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01633133

R. Madhavan, S. Kulal, and V. Kuncak, Contract-based resource verification for higher-order functions with memoization, Principles of Programming Languages (POPL), pp.330-343, 2017.

A. Moran and D. Sands, Improvement in a lazy context: An operational theory for call-by-need, Principles of Programming Languages (POPL), pp.43-56, 1999.

G. Mével, J. H. Jourdan, and F. Pottier, Time credits and time receipts in Iris -Coq proofs, 2018.

C. Okasaki, Purely Functional Data Structures, 1999.

A. Pilkiewicz and F. Pottier, The essence of monotonic state, Types in Language Design and Implementation, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01081193

F. Pottier, Hiding local state in direct style: a higher-order anti-frame rule, Logic in Computer Science (LICS), pp.331-340, 2008.

B. Zhan and M. P. Haslbeck, Verifying asymptotic time complexity of imperative programs in Isabelle, International Joint Conference on Automated Reasoning, 2018.