Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
  • 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.

    https://doi.org/10.1145/3571218

  • 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.

    https://doi.org/10.1145/3498672

  • 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.

    https://doi.org/10.1007/s10817-017-9431-7

  • Deng Y and Zhang Y. (2015). Program equivalence in linear contexts. Theoretical Computer Science. 585:C. (71-90). Online publication date: 20-Jun-2015.

    https://doi.org/10.1016/j.tcs.2015.03.006

  • Hofmann M. Ten years of amortized resource analysis. Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures. (xvii-xix).

    /doi/10.5555/2450348.2450350

  • 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).

    https://doi.org/10.1145/2103656.2103665

  • 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.

    https://doi.org/10.1145/2103621.2103665

  • 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).

    https://doi.org/10.1145/1929553.1929565

  • 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).

    /doi/10.5555/1881833.1881866

  • 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).

    https://doi.org/10.1145/1836089.1836118

  • 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).

    https://doi.org/10.1145/1706299.1706327

  • Jost S, Hammond K, Loidl H and Hofmann M. (2010). Static determination of quantitative resource usage for higher-order programs. ACM SIGPLAN Notices. 45:1. (223-236). Online publication date: 2-Jan-2010.

    https://doi.org/10.1145/1707801.1706327

  • Atkey R. (2009). Parameterised notions of computation. Journal of Functional Programming. 19:3-4. (335-376). Online publication date: 1-Jul-2009.

    https://doi.org/10.1017/S095679680900728X

  • 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.

    https://doi.org/10.1145/1594834.1480908

  • 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).

    https://doi.org/10.1145/1480881.1480908

  • 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.

    https://doi.org/10.1017/S0956796807006399

  • 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).

    https://doi.org/10.1145/1328408.1328436

  • 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).

    /doi/10.5555/1777259.1777287

  • Bonenfant A, Chen Z, Hammond K, Michaelson G, Wallace A and Wallace I. Towards resource-certified software. Proceedings of the 2007 ACM symposium on Applied computing. (1307-1314).

    https://doi.org/10.1145/1244002.1244285

  • 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.

    https://doi.org/10.1145/1183088.1183093

  • Cachera D, Jensen T, Pichardie D and Schneider G. Certified memory usage analysis. Proceedings of the 2005 international conference on Formal Methods. (91-106).

    https://doi.org/10.1007/11526841_8

  • Amadio R. (2005). Synthesis of max-plus quasi-interpretations. Fundamenta Informaticae. 65:1-2. (29-60). Online publication date: 1-Jan-2005.

    /doi/10.5555/2370077.2370080

  • 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.

    https://doi.org/10.1023/B:LISP.0000029446.78563.a4

  • Amadio R. (2004). Synthesis of max-plus quasi-interpretations. Fundamenta Informaticae. 65:1-2. (29-60). Online publication date: 1-Aug-2004.

    /doi/10.5555/1227143.1227146

  • 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).

    https://doi.org/10.1007/978-3-540-30569-9_1

  • 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.

    https://doi.org/10.1023/B:JARS.0000021014.79255.33

  • Loidl H, Rubio F, Scaife N, Hammond K, Horiguchi S, Klusik U, Loogen R, Michaelson G, Peña R, Priebe S, Rebón Á and Trinder P. (2003). Comparing Parallel Functional Languages. Higher-Order and Symbolic Computation. 16:3. (203-251). Online publication date: 1-Sep-2003.

    https://doi.org/10.1023/A:1025641323400

  • 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).

    /doi/10.5555/1762348.1762362

  • Amadio R. Max-plus quasi-interpretations. Proceedings of the 6th international conference on Typed lambda calculi and applications. (31-45).

    /doi/10.5555/1762348.1762351

  • 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.

    https://doi.org/10.1145/640128.604148

  • 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).

    https://doi.org/10.1145/604131.604148

  • 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.

    https://doi.org/10.1145/507382.507386

  • 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).

    /doi/10.5555/1762639.1762650

  • 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).

    /doi/10.5555/645396.651964

  • Hofmann M. The strength of non-size increasing computation. Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (260-269).

    https://doi.org/10.1145/503272.503297

  • Hofmann M. (2002). The strength of non-size increasing computation. ACM SIGPLAN Notices. 37:1. (260-269). Online publication date: 1-Jan-2002.

    https://doi.org/10.1145/565816.503297

  • Hofmann M. From bounded arithmetic to memory management. Proceedings of the 5th international conference on Typed lambda calculi and applications. (2-3).

    /doi/10.5555/1754621.1754624