Lambda Calculus Characterizations of Poly-Time. - Daniel Leivant; Jean-Yves Marion (Fundam. Informaticae, 1993)

Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. - Daniel Leivant; Jean-Yves Marion (CSL, 1994)

Case Study: Additive Linear Logic and Lattices. - Jean-Yves Marion (LFCS, 1997)

Predicative Functional Recurrence and Poly-space. - Daniel Leivant; Jean-Yves Marion (TAPSOFT, 1997)

Complexity Classes and Rewrite Systems with Polynomial Interpretation. - Guillaume Bonfante; Adam Cichon; Jean-Yves Marion; Hélène Touzet (CSL, 1998)

From Multiple Sequent for Additive Linear Logic to Decision Procedures for Free Lattices. - Jean-Yves Marion (Theor. Comput. Sci., 1999)

Efficient First Order Functional Program Interpreter with Time Bound Certifications. - Jean-Yves Marion; Jean-Yves Moyen (LPAR, 2000)

The Light Lexicographic path Ordering - E. A. Cichon; Jean-Yves Marion (CoRR, 2000)

A characterization of alternating log time by ramified recurrence. - Daniel Leivant; Jean-Yves Marion (Theor. Comput. Sci., 2000)

Actual Arithmetic and Feasibility. - Jean-Yves Marion (CSL, 2001)

On Lexicographic Termination Ordering with Space Bound Certifications. - Guillaume Bonfante; Jean-Yves Marion; Jean-Yves Moyen (Ershov Memorial Conference, 2001)

Algorithms with polynomial interpretation termination proof. - Guillaume Bonfante; Adam Cichon; Jean-Yves Marion; Hélène Touzet (J. Funct. Program., 2001)

Learning languages from positive examples with dependencies. - Jérôme Besombes; Jean-Yves Marion (TAG+, 2002)

Kolmogorov complexity and non-determinism. - Serge Grigorieff; Jean-Yves Marion (Theor. Comput. Sci., 2002)

Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. - Olivier Bournez; Felipe Cucker; Paulin Jacobé de Naurois; Jean-Yves Marion (FoSSaCS, 2003)

Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. - Olivier Bournez; Felipe Cucker; Paulin Jacobé de Naurois; Jean-Yves Marion (ICC@LICS, 2003)

Analysing the implicit complexity of programs. - Jean-Yves Marion (Inf. Comput., 2003)

Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures. - Olivier Bournez; Felipe Cucker; Paulin Jacobé de Naurois; Jean-Yves Marion (IFIP TCS, 2004)

Learning reversible categorial grammars from structures. - Jérôme Besombes; Jean-Yves Marion (Intelligent Information Systems, 2004)

Editorial: Implicit Computational Complexity. - Jean-Yves Marion (Theor. Comput. Sci., 2004)

Toward an Abstract Computer Virology. - Guillaume Bonfante; Matthieu Kaczmarek; Jean-Yves Marion (ICTAC, 2005)

Quasi-interpretations and Small Space Bounds. - Guillaume Bonfante; Jean-Yves Marion; Jean-Yves Moyen (RTA, 2005)

Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time. - Olivier Bournez; Felipe Cucker; Paulin Jacobé de Naurois; Jean-Yves Marion (J. Log. Comput., 2005)

Computers under Attacks! - Anne Bonfante; Jean-Yves Marion (PhiSE, 2006)

Towards an Implicit Characterization of NCk. - Guillaume Bonfante; Reinhard Kahle; Jean-Yves Marion; Isabel Oitavem (CSL, 2006)

Resource Analysis by Sup-interpretation. - Jean-Yves Marion; Romain Péchoux (FLOPS, 2006)

A Characterization of Alternating Log Time by First Order Functional Programs. - Guillaume Bonfante; Jean-Yves Marion; Romain Péchoux (LPAR, 2006)

Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants. - Pascal Fontaine; Jean-Yves Marion; Stephan Merz; Leonor Prensa Nieto; Alwen Fernanto Tiu (TACAS, 2006)

Quasi-friendly sup-interpretations - Jean-Yves Marion; Romain Péchoux (CoRR, 2006)

Implicit complexity over an arbitrary structure: Quantifier alternations. - Olivier Bournez; Felipe Cucker; Paulin Jacobé de Naurois; Jean-Yves Marion (Inf. Comput., 2006)

On Abstract Computer Virology from a Recursion Theoretic Perspective. - Guillaume Bonfante; Matthieu Kaczmarek; Jean-Yves Marion (J. Comput. Virol., 2006)

A Classification of Viruses Through Recursion Theorems. - Guillaume Bonfante; Matthieu Kaczmarek; Jean-Yves Marion (CiE, 2007)

Quasi-interpretation Synthesis by Decomposition. - Guillaume Bonfante; Jean-Yves Marion; Romain Péchoux (ICTAC, 2007)

Predicative Analysis of Feasibility and Diagonalization. - Jean-Yves Marion (TLCA, 2007)

Resource control of object-oriented programs - Jean-Yves Marion; Romain Péchoux (CoRR, 2007)

Soft Linear Logic and Polynomial Complexity Classes. - Marco Gaboardi; Jean-Yves Marion; Simona Ronchi Della Rocca (LSFA, 2007)

Learning tree languages from positive examples and membership queries. - Jérôme Besombes; Jean-Yves Marion (Theor. Comput. Sci., 2007)

Foreword. - Guillaume Bonfante; Jean-Yves Marion (J. Comput. Virol., 2007)

On the defence notion. - Anne Bonfante; Jean-Yves Marion (J. Comput. Virol., 2007)

Recursion Schemata for NCk. - Guillaume Bonfante; Reinhard Kahle; Jean-Yves Marion; Isabel Oitavem (CSL, 2008)

Analyzing the Implicit Computational Complexity of object-oriented programs. - Jean-Yves Marion; Romain Péchoux (FSTTCS, 2008)

Morphological detection of malware. - Guillaume Bonfante; Matthieu Kaczmarek; Jean-Yves Marion (MALWARE, 2008)

A logical account of pspace. - Marco Gaboardi; Jean-Yves Marion; Simona Ronchi Della Rocca (POPL, 2008)

Characterizations of polynomial complexity classes with a better intensionality. - Jean-Yves Marion; Romain Péchoux (PPDP, 2008)

A Characterization of NCk. - Jean-Yves Marion; Romain Péchoux (TAMC, 2008)

Learning discrete categorial grammars from structures. - Jérôme Besombes; Jean-Yves Marion (RAIRO Theor. Informatics Appl., 2008)

Server-side dynamic code analysis. - Wadie Guizani; Jean-Yves Marion; Daniel Reynaud-Plantey (MALWARE, 2009)

A Computability Perspective on Self-Modifying Programs. - Guillaume Bonfante; Jean-Yves Marion; Daniel Reynaud-Plantey (SEFM, 2009)

Preface - 26th International Symposium on Theoretical Aspects of Computer Science. - Susanne Albers; Jean-Yves Marion (STACS, 2009)

On tiered small jump operators - Jean-Yves Marion (Log. Methods Comput. Sci., 2009)

Guest editorial: Special issue on implicit computational complexity. - Patrick Baillot; Jean-Yves Marion; Simona Ronchi Della Rocca (ACM Trans. Comput. Log., 2009)

Sup-interpretations, a semantic method for static analysis of program resources. - Jean-Yves Marion; Romain Péchoux (ACM Trans. Comput. Log., 2009)

Architecture of a morphological malware detector. - Guillaume Bonfante; Matthieu Kaczmarek; Jean-Yves Marion (J. Comput. Virol., 2009)

The case for in-the-lab botnet experimentation: creating and taking down a 3000-node botnet. - Joan Calvet; Carlton R. Davis; José M. Fernandez 001; Jean-Yves Marion; Pier-Luc St-Onge; Wadie Guizani; Pierre-Marc Bureau; Anil Somayaji (ACSAC, 2010)

Behavior Abstraction in Malware Analysis. - Philippe Beaucamps; Isabelle Gnaedig; Jean-Yves Marion (RV, 2010)

Foreword – 27th International Symposium on Theoretical Aspects of Computer Science. - Jean-Yves Marion; Thomas Schwentick (STACS, 2010)

Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science. - Jean-Yves Marion; Thomas Schwentick (STACS, 2010)

Isolated Virtualised Clusters: Testbeds for High-Risk Security Experimentation and Training. - Joan Calvet; Carlton R. Davis; José M. Fernandez 001; Wadie Guizani; Matthieu Kaczmarek; Jean-Yves Marion; Pier-Luc St-Onge (CSET, 2010)

A Type System for Complexity Flow Analysis. - Jean-Yves Marion (LICS, 2011)

Preface: Special Issue on Theoretical Aspects of Computer Science (STACS). - Susanne Albers; Jean-Yves Marion (Theory Comput. Syst., 2011)

Quasi-interpretations a way to control resources. - Guillaume Bonfante; Jean-Yves Marion; Jean-Yves Moyen (Theor. Comput. Sci., 2011)

Aligot: cryptographic function identification in obfuscated binary programs. - Joan Calvet; José M. Fernandez 001; Jean-Yves Marion (CCS, 2012)

Abstraction-Based Malware Analysis Using Rewriting and Model Checking. - Philippe Beaucamps; Isabelle Gnaedig; Jean-Yves Marion (ESORICS, 2012)

Code synchronization by morphological analysis. - Guillaume Bonfante; Jean-Yves Marion; Fabrice Sabatier; Aurélien Thierry (MALWARE, 2012)

Viruses in Turing's Garden. - Jean-Yves Marion (ERCIM News, 2012)

Theoretical Aspects of Computer Science. - Jean-Yves Marion; Thomas Schwentick (Theory Comput. Syst., 2012)

An Implicit Characterization of PSPACE. - Marco Gaboardi; Jean-Yves Marion; Simona Ronchi Della Rocca (ACM Trans. Comput. Log., 2012)

Type-Based Complexity Analysis for Fork Processes. - Emmanuel Hainry; Jean-Yves Marion; Romain Péchoux (FoSSaCS, 2013)

Evolving Graph-Structures and Their Implicit Computational Complexity. - Daniel Leivant; Jean-Yves Marion (ICALP (2), 2013)

Analysis and diversion of Duqu's driver. - Guillaume Bonfante; Jean-Yves Marion; Fabrice Sabatier; Aurélien Thierry (MALWARE, 2013)

Implicit Computational Complexity and Applications: Resource Control, Security, Real-Number Computation (NII Shonan Meeting 2013-13). - Akitoshi Kawamura; Jean-Yves Marion; David Nowak (NII Shonan Meet. Rep., 2013)

Malware Message Classification by Dynamic Analysis. - Guillaume Bonfante; Jean-Yves Marion; Thanh Dinh Ta (FPS, 2014)

Complexity Information Flow in a Multi-threaded Imperative Language. - Jean-Yves Marion; Romain Péchoux (TAMC, 2014)

CoDisasm: Medium Scale Concatic Disassembly of Self-Modifying Binaries with Overlapping Instructions. - Guillaume Bonfante; José M. Fernandez 001; Jean-Yves Marion; Benjamin Rouxel; Fabrice Sabatier; Aurélien Thierry (CCS, 2015)

Sound and Quasi-Complete Detection of Infeasible Test Requirements. - Sébastien Bardin; Mickaël Delahaye; Robin David; Nikolai Kosmatov; Mike Papadakis; Yves Le Traon; Jean-Yves Marion (ICST, 2015)

Gorille sniffs code similarities, the case study of qwerty versus regin. - Guillaume Bonfante; Jean-Yves Marion; Fabrice Sabatier (MALWARE, 2015)

Developments in implicit computational complexity. - Jean-Yves Marion (Inf. Comput., 2015)

Low level code analysis and applications to computer security (NII Shonan Meeting 2015-4). - Jean-Yves Marion; Akira Mori; Mizuhito Ogawa (NII Shonan Meet. Rep., 2015)

Specification of concretization and symbolization policies in symbolic execution. - Robin David; Sébastien Bardin; Josselin Feist; Laurent Mounier; Marie-Laure Potet; Thanh Dinh Ta; Jean-Yves Marion (ISSTA, 2016)

BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level Analysis. - Robin David; Sébastien Bardin; Thanh Dinh Ta; Laurent Mounier; Josselin Feist; Marie-Laure Potet; Jean-Yves Marion (SANER, 2016)

Targeting Infeasibility Questions on Obfuscated Codes. - Robin David; Sébastien Bardin; Jean-Yves Marion (CoRR, 2016)

Gorille: Efficient and Relevant Software Comparisons. - Philippe Antoine; Guillaume Bonfante; Jean-Yves Marion (ERCIM News, 2016)

Two function algebras defining functions in NCk boolean circuits. - Guillaume Bonfante; Reinhard Kahle; Jean-Yves Marion; Isabel Oitavem (Inf. Comput., 2016)

A construction of a self-modifiying language with a formal correction proof. - Guillaume Bonfante; Hubert Godfroy; Jean-Yves Marion (MALWARE, 2017)

Backward-Bounded DSE: Targeting Infeasibility Questions on Obfuscated Codes. - Sébastien Bardin; Robin David; Jean-Yves Marion (IEEE Symposium on Security and Privacy, 2017)

Towards Paving the Way for Large-Scale Windows Malware Analysis: Generic Binary Unpacking with Orders-of-Magnitude Performance Boost. - Binlin Cheng; Jiang Ming 002; Jianming Fu; Guojun Peng; Ting Chen 002; Xiaosong Zhang 001; Jean-Yves Marion (CCS, 2018)

Implicit complexity via structure transformation. - Daniel Leivant; Jean-Yves Marion (CoRR, 2018)

How to kill symbolic deobfuscation for free (or: unleashing the potential of path-oriented protections). - Mathilde Ollivier; Sébastien Bardin; Richard Bonichon; Jean-Yves Marion (ACSAC, 2019)

Theoretical Computer Science: Computability, Decidability and Logic. - Olivier Bournez; Gilles Dowek; Rémi Gilleron; Serge Grigorieff; Jean-Yves Marion; Simon Perdrix; Sophie Tison (A Guided Tour of Artificial Intelligence Research (3) (III), 2020)

Theoretical Computer Science: Computational Complexity. - Olivier Bournez; Gilles Dowek; Rémi Gilleron; Serge Grigorieff; Jean-Yves Marion; Simon Perdrix; Sophie Tison (A Guided Tour of Artificial Intelligence Research (3) (III), 2020)

Primitive recursion in the abstract. - Daniel Leivant; Jean-Yves Marion (Math. Struct. Comput. Sci., 2020)

Obfuscation-Resilient Executable Payload Extraction From Packed Malware. - Binlin Cheng; Jiang Ming 002; Erika A. Leal; Haotian Zhang; Jianming Fu; Guojun Peng; Jean-Yves Marion (USENIX Security Symposium, 2021)

Binary level toolchain provenance identification with graph neural networks. - Tristan Benoit; Jean-Yves Marion; Sébastien Bardin (SANER, 2021)

A tier-based typed programming language characterizing Feasible Functionals. - Emmanuel Hainry; Bruce M. Kapron; Jean-Yves Marion; Romain Péchoux (Log. Methods Comput. Sci., 2022)

Scalable Program Clone Search through Spectral Analysis. - Tristan Benoit; Jean-Yves Marion; Sébastien Bardin (ESEC/SIGSOFT FSE, 2023)

Declassification Policy for Program Complexity Analysis. - Emmanuel Hainry; Bruce M. Kapron; Jean-Yves Marion; Romain Péchoux (LICS, 2024)

Trace Partitioning as an Optimization Problem. - M. Charles Babu; Matthieu Lemerre; Sébastien Bardin; Jean-Yves Marion (SAS, 2024)

Complete and tractable machine-independent characterizations of second-order polytime. - Emmanuel Hainry; Bruce M. Kapron; Jean-Yves Marion; Romain Péchoux (Log. Methods Comput. Sci., 2025)

Ransomware: Extortion Is My Business. - Jean-Yves Marion (Commun. ACM, 2025)