Jean-Yves Marion

ORCID

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 23

Top Venues

Publications

Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
Declassification Policy for Program Complexity Analysis. LICS (2024)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
Declassification Policy for Program Complexity Analysis. CoRR (2024)
Tristan Benoit, Jean-Yves Marion, Sébastien Bardin
Scalable Program Clone Search through Spectral Analysis. ESEC/SIGSOFT FSE (2023)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
Complete and tractable machine-independent characterizations of second-order polytime. FoSSaCS (2022)
Tristan Benoit, Jean-Yves Marion, Sébastien Bardin
Scalable Program Clone Search Through Spectral Analysis. CoRR (2022)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
Complete and tractable machine-independent characterizations of second-order polytime. CoRR (2022)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
A tier-based typed programming language characterizing Feasible Functionals. Log. Methods Comput. Sci. 18 (1) (2022)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
A tier-based typed programming language characterizing Feasible Functionals. CoRR (2021)
Tristan Benoit, Jean-Yves Marion, Sébastien Bardin
Binary level toolchain provenance identification with graph neural networks. SANER (2021)
Binlin Cheng, Jiang Ming, Erika A. Leal, Haotian Zhang, Jianming Fu, Guojun Peng, Jean-Yves Marion
Obfuscation-Resilient Executable Payload Extraction From Packed Malware. USENIX Security Symposium (2021)
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
A tier-based typed programming language characterizing Feasible Functionals. LICS (2020)
Daniel Leivant, Jean-Yves Marion
Primitive recursion in the abstract. Math. Struct. Comput. Sci. 30 (1) (2020)
Mathilde Ollivier, Sébastien Bardin, Richard Bonichon, Jean-Yves Marion
How to Kill Symbolic Deobfuscation for Free; or Unleashing the Potential of Path-Oriented Protections. CoRR (2019)
Mathilde Ollivier, Sébastien Bardin, Richard Bonichon, Jean-Yves Marion
How to kill symbolic deobfuscation for free (or: unleashing the potential of path-oriented protections). ACSAC (2019)
Daniel Leivant, Jean-Yves Marion
Implicit complexity via structure transformation. CoRR (2018)
Binlin Cheng, Jiang Ming, Jianming Fu, Guojun Peng, Ting Chen, Xiaosong Zhang, Jean-Yves Marion
Towards Paving the Way for Large-Scale Windows Malware Analysis: Generic Binary Unpacking with Orders-of-Magnitude Performance Boost. CCS (2018)
Guillaume Bonfante, Hubert Godfroy, Jean-Yves Marion
A construction of a self-modifiying language with a formal correction proof. MALWARE (2017)
Sébastien Bardin, Robin David, Jean-Yves Marion
Backward-Bounded DSE: Targeting Infeasibility Questions on Obfuscated Codes. IEEE Symposium on Security and Privacy (2017)
Robin David, Sébastien Bardin, Jean-Yves Marion
Targeting Infeasibility Questions on Obfuscated Codes. CoRR (2016)
Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem
boolean circuits. Inf. Comput. 248 (2016)
Robin David, Sébastien Bardin, Thanh Dinh Ta, Laurent Mounier, Josselin Feist, Marie-Laure Potet, Jean-Yves Marion
BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level Analysis. SANER (2016)
Robin David, Sébastien Bardin, Josselin Feist, Laurent Mounier, Marie-Laure Potet, Thanh Dinh Ta, Jean-Yves Marion
Specification of concretization and symbolization policies in symbolic execution. ISSTA (2016)
Philippe Antoine, Guillaume Bonfante, Jean-Yves Marion
Gorille: Efficient and Relevant Software Comparisons. ERCIM News 2016 (106) (2016)
Guillaume Bonfante, José M. Fernandez, Jean-Yves Marion, Benjamin Rouxel, Fabrice Sabatier, Aurélien Thierry
CoDisasm: Medium Scale Concatic Disassembly of Self-Modifying Binaries with Overlapping Instructions. CCS (2015)
Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier
Gorille sniffs code similarities, the case study of qwerty versus regin. MALWARE (2015)
Sébastien Bardin, Mickaël Delahaye, Robin David, Nikolai Kosmatov, Mike Papadakis, Yves Le Traon, Jean-Yves Marion
Sound and Quasi-Complete Detection of Infeasible Test Requirements. ICST (2015)
Jean-Yves Marion
Developments in implicit computational complexity. Inf. Comput. 241 (2015)
Jean-Yves Marion, Akira Mori, Mizuhito Ogawa
Low level code analysis and applications to computer security (NII Shonan Meeting 2015-4). NII Shonan Meet. Rep. 2015 (2015)
Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurélien Thierry
Analysis and Diversion of Duqu's Driver. CoRR (2014)
Guillaume Bonfante, Jean-Yves Marion, Thanh Dinh Ta
Malware Message Classification by Dynamic Analysis. FPS (2014)
Jean-Yves Marion, Romain Péchoux
Complexity Information Flow in a Multi-threaded Imperative Language. TAMC (2014)
Emmanuel Hainry, Jean-Yves Marion, Romain Péchoux
Type-Based Complexity Analysis for Fork Processes. FoSSaCS (2013)
Akitoshi Kawamura, Jean-Yves Marion, David Nowak
Implicit Computational Complexity and Applications: Resource Control, Security, Real-Number Computation (NII Shonan Meeting 2013-13). NII Shonan Meet. Rep. 2013 (2013)
Daniel Leivant, Jean-Yves Marion
Evolving Graph-Structures and Their Implicit Computational Complexity. ICALP (2) (2013)
Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurélien Thierry
Analysis and diversion of Duqu's driver. MALWARE (2013)
Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurélien Thierry
Code synchronization by morphological analysis. MALWARE (2012)
Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion
Abstraction-Based Malware Analysis Using Rewriting and Model Checking. ESORICS (2012)
Jean-Yves Marion, Thomas Schwentick
Theoretical Aspects of Computer Science. Theory Comput. Syst. 51 (2) (2012)
Joan Calvet, José M. Fernandez, Jean-Yves Marion
Aligot: cryptographic function identification in obfuscated binary programs. CCS (2012)
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca
An Implicit Characterization of PSPACE. ACM Trans. Comput. Log. 13 (2) (2012)
Jean-Yves Marion, Romain Péchoux
Complexity Information Flow in a Multi-threaded Imperative Language CoRR (2012)
Jean-Yves Marion
Viruses in Turing's Garden. ERCIM News 2012 (91) (2012)
Jean-Yves Marion
A Type System for Complexity Flow Analysis. LICS (2011)
Susanne Albers, Jean-Yves Marion
Preface: Special Issue on Theoretical Aspects of Computer Science (STACS). Theory Comput. Syst. 48 (3) (2011)
Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen
Quasi-interpretations a way to control resources. Theor. Comput. Sci. 412 (25) (2011)
Joan Calvet, Carlton R. Davis, José M. Fernandez, Jean-Yves Marion, Pier-Luc St-Onge, Wadie Guizani, Pierre-Marc Bureau, Anil Somayaji
The case for in-the-lab botnet experimentation: creating and taking down a 3000-node botnet. ACSAC (2010)
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca
An Implicit Characterization of PSPACE CoRR (2010)
Joan Calvet, Carlton R. Davis, José M. Fernandez, Wadie Guizani, Matthieu Kaczmarek, Jean-Yves Marion, Pier-Luc St-Onge
Isolated Virtualised Clusters: Testbeds for High-Risk Security Experimentation and Training. CSET (2010)
Jean-Yves Marion, Thomas Schwentick
Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science. STACS (2010)
Jean-Yves Marion, Thomas Schwentick
Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science. STACS (2010)
Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion
Behavior Abstraction in Malware Analysis. RV (2010)
Jean-Yves Marion, Romain Péchoux
Sup-interpretations, a semantic method for static analysis of program resources. ACM Trans. Comput. Log. 10 (4) (2009)
Jean-Yves Marion
On tiered small jump operators Log. Methods Comput. Sci. 5 (1) (2009)
Wadie Guizani, Jean-Yves Marion, Daniel Reynaud-Plantey
Server-side dynamic code analysis. MALWARE (2009)
Patrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca
Guest editorial: Special issue on implicit computational complexity. ACM Trans. Comput. Log. 10 (4) (2009)
Guillaume Bonfante, Jean-Yves Marion, Daniel Reynaud-Plantey
A Computability Perspective on Self-Modifying Programs. SEFM (2009)
Susanne Albers, Jean-Yves Marion
Preface - 26th International Symposium on Theoretical Aspects of Computer Science. STACS (2009)
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
Architecture of a morphological malware detector. J. Comput. Virol. 5 (3) (2009)
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
Morphological detection of malware. MALWARE (2008)
Jean-Yves Marion, Romain Péchoux
A Characterization of NCk. TAMC (2008)
Jean-Yves Marion, Romain Péchoux
Characterizations of polynomial complexity classes with a better intensionality. PPDP (2008)
Jean-Yves Marion, Romain Péchoux
Analyzing the Implicit Computational Complexity of object-oriented programs. FSTTCS (2008)
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca
A logical account of pspace. POPL (2008)
Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem
Recursion Schemata for NCk. CSL (2008)
Jérôme Besombes, Jean-Yves Marion
Learning discrete categorial grammars from structures. RAIRO Theor. Informatics Appl. 42 (1) (2008)
Anne Bonfante, Jean-Yves Marion
On the defence notion CoRR (2007)
Jean-Yves Marion
Predicative Analysis of Feasibility and Diagonalization. TLCA (2007)
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
A Classification of Viruses Through Recursion Theorems. CiE (2007)
Guillaume Bonfante, Jean-Yves Marion
Foreword. J. Comput. Virol. 3 (1) (2007)
Jérôme Besombes, Jean-Yves Marion
Learning tree languages from positive examples and membership queries. Theor. Comput. Sci. 382 (3) (2007)
Jean-Yves Marion, Romain Péchoux
Resource control of object-oriented programs CoRR (2007)
Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux
Quasi-interpretation Synthesis by Decomposition. ICTAC (2007)
Anne Bonfante, Jean-Yves Marion
On the defence notion. J. Comput. Virol. 3 (4) (2007)
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca
Soft Linear Logic and Polynomial Complexity Classes. LSFA (2007)
Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem
. CSL (2006)
Anne Bonfante, Jean-Yves Marion
Computers under Attacks! PhiSE (2006)
Pascal Fontaine, Jean-Yves Marion, Stephan Merz, Leonor Prensa Nieto, Alwen Fernanto Tiu
Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants. TACAS (2006)
Jean-Yves Marion, Romain Péchoux
Quasi-friendly sup-interpretations CoRR (2006)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Implicit complexity over an arbitrary structure: Quantifier alternations. Inf. Comput. 204 (2) (2006)
Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux
A Characterization of Alternating Log Time by First Order Functional Programs. LPAR (2006)
Jean-Yves Marion, Romain Péchoux
Resource Analysis by Sup-interpretation. FLOPS (2006)
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
On Abstract Computer Virology from a Recursion Theoretic Perspective. J. Comput. Virol. 1 (3-4) (2006)
Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen
Quasi-interpretations and Small Space Bounds. RTA (2005)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time. J. Log. Comput. 15 (1) (2005)
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
Toward an Abstract Computer Virology. ICTAC (2005)
Jérôme Besombes, Jean-Yves Marion
Learning Tree Languages from Positive Examples and Membership Queries. ALT (2004)
Jean-Yves Marion
Editorial: Implicit Computational Complexity. Theor. Comput. Sci. 318 (1-2) (2004)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures. IFIP TCS (2004)
Jérôme Besombes, Jean-Yves Marion
Learning reversible categorial grammars from structures. Intelligent Information Systems (2004)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. Electron. Notes Theor. Comput. Sci. 90 (2003)
Jean-Yves Marion
Analysing the implicit complexity of programs. Inf. Comput. 183 (1) (2003)
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. FoSSaCS (2003)
Jérôme Besombes, Jean-Yves Marion
Learning languages from positive examples with dependencies. TAG+ (2002)
Serge Grigorieff, Jean-Yves Marion
Kolmogorov complexity and non-determinism. Theor. Comput. Sci. 271 (1-2) (2002)
Jean-Yves Marion
Actual Arithmetic and Feasibility. CSL (2001)
Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet
Algorithms with polynomial interpretation termination proof. J. Funct. Program. 11 (1) (2001)
Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen
On Lexicographic Termination Ordering with Space Bound Certifications. Ershov Memorial Conference (2001)
Jean-Yves Marion, Jean-Yves Moyen
Efficient First Order Functional Program Interpreter with Time Bound Certifications. LPAR (2000)
Daniel Leivant, Jean-Yves Marion
A characterization of alternating log time by ramified recurrence. Theor. Comput. Sci. 236 (1-2) (2000)
E. A. Cichon, Jean-Yves Marion
The Light Lexicographic path Ordering CoRR (2000)

Jean-Yves Marion.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jean-Yves Marion