Moine A, Charguéraud A and Pottier F.
(2023). A High-Level Separation Logic for Heap Space under Garbage Collection. Proceedings of the ACM on Programming Languages. 7:POPL. (718-747). Online publication date: 9-Jan-2023.
Madiot J and Pottier F.
(2022). A separation logic for heap space under garbage collection. Proceedings of the ACM on Programming Languages. 6:POPL. (1-28). Online publication date: 16-Jan-2022.
Charguéraud A and Pottier F.
(2019). Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits. Journal of Automated Reasoning. 62:3. (331-365). Online publication date: 1-Mar-2019.
Deng Y and Zhang Y.
(2015). Program equivalence in linear contexts. Theoretical Computer Science. 585:C. (71-90). Online publication date: 20-Jun-2015.
Hofmann M. Ten years of amortized resource analysis. Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures. (xvii-xix).
Krishnaswami N, Benton N and Hoffmann J. Higher-order functional reactive programming in bounded space. Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (45-58).
Krishnaswami N, Benton N and Hoffmann J.
(2012). Higher-order functional reactive programming in bounded space. ACM SIGPLAN Notices. 47:1. (45-58). Online publication date: 18-Jan-2012.
Pilkiewicz A and Pottier F. The essence of monotonic state. Proceedings of the 7th ACM SIGPLAN workshop on Types in language design and implementation. (73-86).
Shi R, Zhu D and Xi H. A modality for safe resource sharing and code reentrancy. Proceedings of the 7th International colloquium conference on Theoretical aspects of computing. (382-396).
Baillot P and Hofmann M. Type inference in intuitionistic linear logic. Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming. (219-230).
Jost S, Hammond K, Loidl H and Hofmann M. Static determination of quantitative resource usage for higher-order programs. Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (223-236).
Tozawa A, Tatsubori M, Onodera T and Minamide Y.
(2009). Copy-on-write in the PHP language. ACM SIGPLAN Notices. 44:1. (200-212). Online publication date: 21-Jan-2009.
Tozawa A, Tatsubori M, Onodera T and Minamide Y. Copy-on-write in the PHP language. Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (200-212).
Aspinall D, Hofmann M and KoneČnÝ M.
(2008). A type system with usage aspects. Journal of Functional Programming. 18:2. (141-178). Online publication date: 1-Mar-2008.
Hage J and Holdermans S. Heap recycling for lazy languages. Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation. (189-197).
Bonfante G, Marion J and Péchoux R. Quasi-interpretation synthesis by decomposition an application to higher-order programs. Proceedings of the 4th international conference on Theoretical aspects of computing. (410-424).
Hammond K, Ferdinand C and Heckmann R.
(2006). Towards formally verifiable resource bounds for real-time embedded systems. ACM SIGBED Review. 3:4. (27-36). Online publication date: 1-Oct-2006.
Cachera D, Jensen T, Pichardie D and Schneider G. Certified memory usage analysis. Proceedings of the 2005 international conference on Formal Methods. (91-106).
Tofte M, Birkedal L, Elsman M and Hallenberg N.
(2004). A Retrospective on Region-Based Memory Management. Higher-Order and Symbolic Computation. 17:3. (245-265). Online publication date: 1-Sep-2004.
Aspinall D, Gilmore S, Hofmann M, Sannella D and Stark I. Mobile resource guarantees for smart devices. Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices. (1-26).
Aspinall D and Compagnoni A.
(2004). Heap-Bounded Assembly Language. Journal of Automated Reasoning. 31:3-4. (261-302). Online publication date: 15-Jan-2004.
Konečny M. Functional in-place update with layered datatype sharing. Proceedings of the 6th international conference on Typed lambda calculi and applications. (195-210).
Hofmann M and Jost S.
(2003). Static prediction of heap space usage for first-order functional programs. ACM SIGPLAN Notices. 38:1. (185-197). Online publication date: 15-Jan-2003.
Hofmann M and Jost S. Static prediction of heap space usage for first-order functional programs. Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (185-197).
Aehlig K and Schwichtenberg H.
(2002). A syntactical analysis of non-size-increasing polynomial time computation. ACM Transactions on Computational Logic. 3:3. (383-401). Online publication date: 1-Jul-2002.
Konečny M. Typing with conditions and guarantees for functional in-place update. Proceedings of the 2002 international conference on Types for proofs and programs. (182-199).
Aspinall D and Hofmann M. Another Type System for In-Place Update. Proceedings of the 11th European Symposium on Programming Languages and Systems. (36-52).
Hofmann M. The strength of non-size increasing computation. Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (260-269).
Hofmann M. From bounded arithmetic to memory management. Proceedings of the 5th international conference on Typed lambda calculi and applications. (2-3).