See also my entry on dblp.

Publications

demange
[1] Timothy Bourke and Delphine Demange, editors. JFLA 2023 - 34èmes Journées Francophones des Langages Applicatifs, Journées Francophones des Langages Applicatifs, January 2023. [ http ]
[2] Yann Herklotz, Delphine Demange, and Sandrine Blazy. Mechanised semantics for gated static single assignment. In Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2023, page 182–196, New York, NY, USA, 2023. Association for Computing Machinery. [ DOI | http ]
[3] Aaron Smith, Delphine Demange, and Rajiv Gupta, editors. CC 2021: Proceedings of the 30th ACM SIGPLAN International Conference on Compiler Construction, New York, NY, USA, 2021. Association for Computing Machinery. [ DOI | http ]
[4] Gautier Berthou, Pierre-Évariste Dagand, Delphine Demange, Rémi Oudin, and Tanguy Risset. Intermittent computing with peripherals, formally verified. In The 21st ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems, LCTES ’20, page 85–96, Richland, SC, 2020. International Foundation for Autonomous Agents and Multiagent Systems. [ DOI | http ]
[5] Yannick Zakowski, David Cachera, Delphine Demange, Gustavo Petri, David Pichardie, Suresh Jagannathan, and Jan Vitek. Verifying a concurrent garbage collector with a rely-guarantee methodology. Journal of Automated Reasoning, November 2018. [ DOI | http ]
[6] Delphine Demange, Yon Fernández de Retana, and David Pichardie. Semantic reasoning about the sea of nodes. In Proceedings of the 27th International Conference on Compiler Construction, CC 2018, pages 163-173, New York, NY, USA, 2018. ACM. [ DOI | http ]
[7] Yannick Zakowski, David Cachera, Delphine Demange, and David Pichardie. Verified compilation of linearizable data structures: Mechanizing rely guarantee for semantic refinement. In Proceedings of the 33rd Annual ACM Symposium on Applied Computing, SAC '18, pages 1881-1890, New York, NY, USA, 2018. ACM. [ DOI | http ]
[8] Yannick Zakowski, David Cachera, Delphine Demange, Gustavo Petri, David Pichardie, Suresh Jagannathan, and Jan Vitek. Verifying a concurrent garbage collector using a rely-guarantee methodology. In Interactive Theorem Proving - 8th International Conference, ITP 2017, Brasília, Brazil, September 26-29, 2017, Proceedings, pages 496-513, 2017. [ DOI | http ]
[9] Arthur Azevedo de Amorim, Nathan Collins, André DeHon, Delphine Demange, Catalin Hritcu, David Pichardie, Benjamin C. Pierce, Randy Pollack, and Andrew Tolmach. A verified information-flow architecture. Journal of Computer Security, 24(6):689-734, 2016. [ DOI | http ]
[10] Delphine Demange and Yon Fernandez de Retana. Mechanizing conventional ssa for a verified destruction with coalescing. In Proceedings of the 25th International Conference on Compiler Construction, CC 2016, pages 77-87, New York, NY, USA, 2016. ACM. [ DOI | http ]
[11] Delphine Demange, David Pichardie, and Léo Stefanesco. Verifying fast and sparse ssa-based optimizations in coq. In Compiler Construction - 24th International Conference, CC 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings, pages 233-252, 2015. [ DOI | http ]
[12] Sandrine Blazy, Delphine Demange, and David Pichardie. Validating dominator trees for a fast, verified dominance test. In Interactive Theorem Proving - 6th International Conference, ITP 2015, Nanjing, China, August 24-27, 2015, Proceedings, pages 84-99, 2015. [ DOI | http ]
[13] Gilles Barthe, Delphine Demange, and David Pichardie. Formal verification of an ssa-based middle-end for compcert. ACM Trans. Program. Lang. Syst., 36(1):4:1-4:35, March 2014. [ DOI | http ]
[14] Arthur Azevedo de Amorim, Nathan Collins, André DeHon, Delphine Demange, Cātālin Hritcu, David Pichardie, Benjamin C. Pierce, Randy Pollack, and Andrew Tolmach. A verified information-flow architecture. In Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pages 165-178, New York, NY, USA, 2014. ACM. [ DOI | http ]
[15] Delphine Demange, Vincent Laporte, Lei Zhao, Suresh Jagannathan, David Pichardie, and Jan Vitek. Plan B: a buffered memory model for java. In The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '13, Rome, Italy - January 23 - 25, 2013, pages 329-342, 2013. [ DOI | http ]
[16] Gilles Barthe, Delphine Demange, and David Pichardie. A formally verified ssa-based middle-end - static single assignment meets compcert. In Programming Languages and Systems - 21st European Symposium on Programming, ESOP 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings, pages 47-66, 2012. [ DOI | http ]
[17] Delphine Demange, Thomas P. Jensen, and David Pichardie. A provably correct stackless intermediate representation for java bytecode. In Programming Languages and Systems - 8th Asian Symposium, APLAS 2010, Shanghai, China, November 28 - December 1, 2010. Proceedings, pages 97-113, 2010. [ DOI | http ]
[18] Laurent Hubert, Nicolas Barré, Frédéric Besson, Delphine Demange, Thomas P. Jensen, Vincent Monfort, David Pichardie, and Tiphaine Turpin. Sawja: Static analysis workshop for java. In Formal Verification of Object-Oriented Software - International Conference, FoVeOOS 2010, Paris, France, June 28-30, 2010, Revised Selected Papers, pages 92-106, 2010. [ DOI | http ]
[19] Delphine Demange and David Sands. All secrets great and small. In Programming Languages and Systems, 18th European Symposium on Programming, ESOP 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings, pages 207-221, 2009. [ DOI | http ]

This file was generated by bibtex2html 1.96.