I'm a Research Assistant in the Programming Principles, Logic and Verification group of UCL in London, working on program verification and concurrency.
I did my PhD at LSV in Cachan (near Paris) under the supervision of Étienne Lozes, during which I created the Heap-Hop tool for the verification of heap-manipulating message-passing programs.
I am actively developing Heap-Hop. It verifies message-passing programs against their Hoare-style separation logic specifications on the one hand, and the communication protocols they implement, expressed using communicating finite state machines, on the other hand.
While Heap-Hop has been great for verifying toy programs written in an idealised language, being able to verify real programs is a different kind of fun! My new tool, LStar, is about verifying LLVM "bitcode" programs using separation logic.
Parametric Completeness for Separation Theories
. UCL Research Note RN/13/11, 2013. [PDF | BibTeX | abstract]On the relation between Concurrent Separation Logic and Concurrent Kleene Algebra
Sharing Contract-Obedient Endpoints (extended version)
. /dd>A Spatial Equational Logic for the Applied π-Calculus
. Distributed Computing 23(1), pages 61-83, 2010. [PDF | BibTeX | abstract]The Ramifications of Sharing in Data Structures
. In POPL'13, pages 523-536. ACM, 2013. [PDF | slides | more…]Tracking Heaps that Hop with Heap-Hop
. In TACAS'10, LNCS 6015, pages 275-279. Springer, 2010. [PDF | BibTeX | abstract]Proving Copyless Message Passing
. In APLAS'09 , LNCS 5904, pages 194-209. Springer, 2009. [PDF | BibTeX | abstract]A Spatial Equational Logic for the Applied π-Calculus
. In CONCUR'08, LNCS 5201, pages 387-401. Springer, 2008. [PDF | BibTeX | abstract]Sharing Contract-Obedient Endpoints
. In ICE'12, EPTCS 104, pages 17-31. Open Publishing Association, 2012. [PDF | BibTeX | abstract]Reliable Contracts for Unreliable Half-Duplex Communications
. In WS-FM'11, LNCS 7176, pages 2-16. Springer, 2011. [PDF | BibTeX | abstract]The Ramification Rule of Separation Logic
. High Confidence Software and Systems Conference, 2012. [abstract | slides]Proving Copyless Message Passing
. Young Researchers Workshop on Concurrency Theory, 2009. [PDF | slides]