| 2025 | CCS | Augmenting Search-based Program Synthesis with Local Inference Rules to Improve Black-box Deobfuscation. | Vidal Attias, Nicolas Bellec, Grgoire Menguy, Sbastien Bardin, Jean-Yves Marion |
| 2024 | LICS | Declassification Policy for Program Complexity Analysis. | Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Pchoux |
| 2024 | SAS | Trace Partitioning as an Optimization Problem. | M. Charles Babu, Matthieu Lemerre, Sbastien Bardin, Jean-Yves Marion |
| 2022 | FOSSACS | Complete and tractable machine-independent characterizations of second-order polytime. | Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Pchoux |
| 2020 | LICS | A tier-based typed programming language characterizing Feasible Functionals. | Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Pchoux |
| 2019 | ACSAC | How to kill symbolic deobfuscation for free (or: unleashing the potential of path-oriented protections). | Mathilde Ollivier, Sbastien Bardin, Richard Bonichon, Jean-Yves Marion |
| 2018 | CCS | Towards Paving the Way for Large-Scale Windows Malware Analysis: Generic Binary Unpacking with Orders-of-Magnitude Performance Boost. | Binlin Cheng, Jiang Ming, Jianming Fu, Guojun Peng, Ting Chen, Xiaosong Zhang, Jean-Yves Marion |
| 2017 | SP | Backward-Bounded DSE: Targeting Infeasibility Questions on Obfuscated Codes. | Sbastien Bardin, Robin David, Jean-Yves Marion |
| 2016 | ISSTA | Specification of concretization and symbolization policies in symbolic execution. | Robin David, Sbastien Bardin, Josselin Feist, Laurent Mounier, Marie-Laure Potet, Thanh Dinh Ta, Jean-Yves Marion |
| 2015 | CCS | CoDisasm: Medium Scale Concatic Disassembly of Self-Modifying Binaries with Overlapping Instructions. | Guillaume Bonfante, Jos M. Fernandez, Jean-Yves Marion, Benjamin Rouxel, Fabrice Sabatier, Aurlien Thierry |
| 2015 | ICST | Sound and Quasi-Complete Detection of Infeasible Test Requirements. | Sbastien Bardin, Mickal Delahaye, Robin David, Nikolai Kosmatov, Mike Papadakis, Yves Le Traon, Jean-Yves Marion |
| 2014 | TAMC | Complexity Information Flow in a Multi-threaded Imperative Language. | Jean-Yves Marion, Romain Pchoux |
| 2013 | FOSSACS | Type-Based Complexity Analysis for Fork Processes. | Emmanuel Hainry, Jean-Yves Marion, Romain Pchoux |
| 2013 | ICALP | Evolving Graph-Structures and Their Implicit Computational Complexity. | Daniel Leivant, Jean-Yves Marion |
| 2012 | CCS | Aligot: cryptographic function identification in obfuscated binary programs. | Joan Calvet, Jos M. Fernandez, Jean-Yves Marion |
| 2012 | ESORICS | Abstraction-Based Malware Analysis Using Rewriting and Model Checking. | Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion |
| 2011 | LICS | A Type System for Complexity Flow Analysis. | Jean-Yves Marion |
| 2010 | ACSAC | The case for in-the-lab botnet experimentation: creating and taking down a 3000-node botnet. | Joan Calvet, Carlton R. Davis, Jos M. Fernandez, Jean-Yves Marion, Pier-Luc St-Onge, Wadie Guizani, Pierre-Marc Bureau, Anil Somayaji |
| 2010 | STACS | Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science. | Jean-Yves Marion, Thomas Schwentick |
| 2010 | STACS | Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science. | Jean-Yves Marion, Thomas Schwentick |
| 2010 | RV | Behavior Abstraction in Malware Analysis. | Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion |
| 2009 | STACS | Preface - 26th International Symposium on Theoretical Aspects of Computer Science. | Susanne Albers, Jean-Yves Marion |
| 2009 | SEFM | A Computability Perspective on Self-Modifying Programs. | Guillaume Bonfante, Jean-Yves Marion, Daniel Reynaud-Plantey |
| 2008 | CSL | Recursion Schemata for NCk. | Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem |
| 2008 | POPL | A logical account of pspace. | Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca |
| 2008 | PPDP | Characterizations of polynomial complexity classes with a better intensionality. | Jean-Yves Marion, Romain Pchoux |
| 2008 | TAMC | A Characterization of NCk. | Jean-Yves Marion, Romain Pchoux |
| 2007 | CiE | A Classification of Viruses Through Recursion Theorems. | Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion |
| 2007 | ICTAC | Quasi-interpretation Synthesis by Decomposition. | Guillaume Bonfante, Jean-Yves Marion, Romain Pchoux |
| 2006 | CaiSE | Computers under Attacks! | Anne Bonfante, Jean-Yves Marion |
| 2006 | CSL | Towards an Implicit Characterization of | Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem |
| 2006 | FLOPS | Resource Analysis by Sup-interpretation. | Jean-Yves Marion, Romain Pchoux |
| 2006 | LPAR | A Characterization of Alternating Log Time by First Order Functional Programs. | Guillaume Bonfante, Jean-Yves Marion, Romain Pchoux |
| 2006 | TACAS | Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants. | Pascal Fontaine, Jean-Yves Marion, Stephan Merz, Leonor Prensa Nieto, Alwen Fernanto Tiu |
| 2005 | ICTAC | Toward an Abstract Computer Virology. | Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion |
| 2004 | ALT | Learning Tree Languages from Positive Examples and Membership Queries. | Jrme Besombes, Jean-Yves Marion |
| 2003 | FOSSACS | Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. | Olivier Bournez, Felipe Cucker, Paulin Jacob de Naurois, Jean-Yves Marion |
| 2001 | CSL | Actual Arithmetic and Feasibility. | Jean-Yves Marion |
| 2000 | LPAR | Efficient First Order Functional Program Interpreter with Time Bound Certifications. | Jean-Yves Marion, Jean-Yves Moyen |
| 1998 | CSL | Complexity Classes and Rewrite Systems with Polynomial Interpretation. | Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hlne Touzet |
| 1997 | LFCS | Case Study: Additive Linear Logic and Lattices. | Jean-Yves Marion |
| 1994 | CSL | Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. | Daniel Leivant, Jean-Yves Marion |