Small Undecidable Problems in Epistemic Planning. - Sébastien Lê Cong; Sophie Pinchinat; François Schwarzentruber (IJCAI, 2018)

Extending Timbuk to Verify Functional Programs. - Thomas Genet; Tristan Gillard; Timothée Haudebourg; Sébastien Lê Cong (WRLA@ETAPS, 2018)

The Packed Interval Covering Problem is NP-complete. - Abdallah Saffidine; Sébastien Lê Cong; Sophie Pinchinat; François Schwarzentruber (CoRR, 2019)

Library-Based Attack Tree Synthesis. - Sophie Pinchinat; François Schwarzentruber; Sébastien Lê Cong (GraMSec@CSF, 2020)