Jean-Yves Marion

Jean-Yves Marion, Marie-Laure Potet, Laurent Mounier, 2016, 2016 IEEE 23rd International Conference on Software Analysis, Evolution, and Reengineering (SANER).

Server-side dynamic code analysis

Jean-Yves Marion, Daniel Reynaud-Plantey, Wadie Guizani, 2009, 2009 4th International Conference on Malicious and Unwanted Software (MALWARE).

Control Flow to Detect Malware

Guillaume Bonfante, Jean-Yves Marion, Matthieu Kaczmarek, 2007 .

Malware Message Classification by Dynamic Analysis

Guillaume Bonfante, Jean-Yves Marion, Thanh Dinh Ta, 2014, FPS.

On behavioral detection

Jean-Yves Marion, Philippe Beaucamps, J. Marion, 2009 .

Learning discrete categorial grammars from structures

Jean-Yves Marion, Jérôme Besombes, 2008, RAIRO Theor. Informatics Appl..

Targeting Infeasibility Questions on Obfuscated Codes pdf

Jean-Yves Marion, Sébastien Bardin, Robin David, 2016, ArXiv.

A Classification of Viruses Through Recursion Theorems

Guillaume Bonfante, Jean-Yves Marion, Matthieu Kaczmarek, 2007, CiE.

Specification of concretization and symbolization policies in symbolic execution

Jean-Yves Marion, Marie-Laure Potet, Laurent Mounier, 2016, ISSTA.

Resource Analysis by Sup-interpretation

Jean-Yves Marion, Romain Péchoux, J. Marion, 2006, FLOPS.

Complexity Classes and Rewrite Systems with Polynomial Interpretation

Guillaume Bonfante, Jean-Yves Marion, Hélène Touzet, 1998, CSL.

Quasi-interpretation Synthesis by Decomposition

Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux, 2007, ICTAC.

A construction of a self-modifiying language with a formal correction proof

Guillaume Bonfante, Jean-Yves Marion, Hubert Godfroy, 2017, 2017 12th International Conference on Malicious and Unwanted Software (MALWARE).

Resource control of object-oriented programs pdf

Jean-Yves Marion, Romain Péchoux, 2007, ArXiv.

On the Impact of Malware on Internet Voting

Eric Filiol, Jean-Yves Marion, Philippe Beaucamps, 2009 .

Foundations and Practice of Security

Joaquin Garcia-Alfaro, Luigi Logrippo, Jean-Yves Marion, 2017, Lecture Notes in Computer Science.

Sup-interpretations, a semantic method for static analysis of program resources

Jean-Yves Marion, Romain Péchoux, 2009, TOCL.

LARGE-SCALE MALWARE EXPERIMENTS: WHY, HOW, AND SO WHAT?

Jean-Yves Marion, Joan Calvet, Pierre-Marc Bureau, 2010 .

Implicit complexity via structure transformation pdf

Daniel Leivant, Jean-Yves Marion, 2018, ArXiv.

An implementation of morphological malware detection

Guillaume Bonfante, Jean-Yves Marion, Matthieu Kaczmarek, 2008 .

Algorithms with polynomial interpretation termination proof

Guillaume Bonfante, Jean-Yves Marion, Hélène Touzet, 2001, Journal of Functional Programming.

Quasi-interpretations and Small Space Bounds

Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen, 2005, RTA.

Behavior Abstraction in Malware Analysis

Jean-Yves Marion, Philippe Beaucamps, Isabelle Gnaedig, 2010, RV.

CoDisasm: Medium Scale Concatic Disassembly of Self-Modifying Binaries with Overlapping Instructions

Guillaume Bonfante, Jean-Yves Marion, José M. Fernandez, 2015, CCS.

26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings

Susanne Albers, Jean-Yves Marion, 2009, STACS.

Learning regular trees with queries

Jean-Yves Marion, Jérôme Besombes, 2004 .

A Characterization of NCk

Jean-Yves Marion, Romain Péchoux, 2008, TAMC.

Obfuscation: where are we in anti-DSE protections? (a first attempt)

Jean-Yves Marion, Richard Bonichon, Sébastien Bardin, 2019, Proceedings of the 9th Workshop on Software Security, Protection, and Reverse Engineering - SSPREW9 '19.

Analyzing the Implicit Computational Complexity of object-oriented programs

Jean-Yves Marion, Romain Péchoux, 2008, FSTTCS.

Gorille sniffs code similarities, the case study of qwerty versus regin

Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, 2015, 2015 10th International Conference on Malicious and Unwanted Software (MALWARE).

Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants

Stephan Merz, Pascal Fontaine, Jean-Yves Marion, 2006, TACAS.

Code synchronization by morphological analysis

Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, 2012, 2012 7th International Conference on Malicious and Unwanted Software.

Special issue on implicit computational complexity

Patrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca, 2006 .

Foreword of WTCV 06

Jean-Yves Marion, Guillaume Bonfante, 2007 .

A logical account of pspace

Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca, 2008, POPL '08.

Isolated Virtualised Clusters: Testbeds for High-Risk Security Experimentation and Training

Jean-Yves Marion, José M. Fernandez, Pier-Luc St-Onge, 2010, CSET.

Learning tree languages from positive examples and membership queries

Jean-Yves Marion, Jérôme Besombes, 2007, Theor. Comput. Sci..

Termination and resource analysis of assembly programs by Petri nets

Jean-Yves Marion, Jean-Yves Moyen, 2003 .

Abstract Self Modifying Machines

Jean-Yves Marion, Hubert Godfroy, 2016 .

Learning languages from positive examples with dependencies

Jean-Yves Marion, Jérôme Besombes, 2002, TAG+.

On tiered small jump operators

Jean-Yves Marion, J. Marion, 2009, Log. Methods Comput. Sci..

Quasi-interpretations a way to control resources

Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen, 2011, Theor. Comput. Sci..

Behavior Analysis of Malicious Code by Weighted Behavior Abstraction

Jean-Yves Marion, Philippe Beaucamps, Isabelle Gnaedig, 2013 .

Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time

Felipe Cucker, Olivier Bournez, Jean-Yves Marion, 2003, FoSSaCS.

Case Study: Additive Linear Logic and Lattices

Jean-Yves Marion, J. Marion, 1997, LFCS.

Low level code analysis and applications to computer security (NII Shonan Meeting 2015-4)

Mizuhito Ogawa, Jean-Yves Marion, Akira Mori, 2015, NII Shonan Meet. Rep..

Heap-size analysis for assembly programs

Jean-Yves Marion, Jean-Yves Moyen, 2006 .

A Characterization of Alternating Log Time by First Order Functional Programs

Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux, 2006, LPAR.

Computers under Attacks!

Jean-Yves Marion, Anne Bonfante, J. Marion, 2006, PhiSE.

Analysis and diversion of Duqu's driver

Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, 2013, 2013 8th International Conference on Malicious and Unwanted Software: "The Americas" (MALWARE).

Characterizations of polynomial complexity classes with a better intensionality

Jean-Yves Marion, Romain Péchoux, 2008, PPDP '08.

Implicit Computational Complexity and Applications: Resource Control, Security, Real-Number Computation (NII Shonan Meeting 2013-13)

Akitoshi Kawamura, Jean-Yves Marion, David Nowak, 2013, NII Shonan Meet. Rep..

On Lexicographic Termination Ordering with Space Bound Certifications

Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen, 2001, Ershov Memorial Conference.

From Multiple Sequent for Additive Linear Logic to Decision Procedures for Free Lattices

Jean-Yves Marion, J. Marion, 1999, Theor. Comput. Sci..

Surfing Code Waves

Jean-Yves Marion, Daniel Reynaud, 2009 .

Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures

Felipe Cucker, Olivier Bournez, Jean-Yves Marion, 2004, IFIP TCS.

A Type System for Complexity Flow Analysis

Jean-Yves Marion, J. Marion, 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

Two function algebras defining functions in NCk boolean circuits

Jean-Yves Marion, Isabel Oitavem, Reinhard Kahle, 2016, Inf. Comput..

Toward an Abstract Computer Virology

Guillaume Bonfante, Jean-Yves Marion, Matthieu Kaczmarek, 2005, ICTAC.

Learning tree languages from positive examples and membership queries

Jean-Yves Marion, Jérôme Besombes, J. Marion, 2007, Theor. Comput. Sci..

Implicit complexity over an arbitrary structure: Quantifier alternations

Felipe Cucker, Olivier Bournez, Jean-Yves Marion, 2006, Inf. Comput..

Proceedings Second Workshop on Developments in Implicit Computational Complexity, Saarbrücken, DICE 2011, Germany, April 2nd and 3rd, 2011

Jean-Yves Marion, 2012, DICE.

Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science

Thomas Schwentick, Jean-Yves Marion, 2010, STACS.

Predicative Functional Recurrence and Poly-space

Daniel Leivant, Jean-Yves Marion, 1997, TAPSOFT.

Preface - 26th International Symposium on Theoretical Aspects of Computer Science

Susanne Albers, Jean-Yves Marion, 2009, STACS.

The case for in-the-lab botnet experimentation: creating and taking down a 3000-node botnet

Jean-Yves Marion, Anil Somayaji, José M. Fernandez, 2010, ACSAC '10.

Theoretical Aspects of Computer Science

Thomas Schwentick, Jean-Yves Marion, 2012, Theory of Computing Systems.

Tiered complexity at higher order

Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux, 2019 .

On the use of Internet Voting on Compromised Computers

Jean-Yves Marion, Philippe Beaucamps, Daniel Reynaud-Plantey, 2009 .

Learning reversible categorial grammars from structures

Jean-Yves Marion, Jérôme Besombes, J. Marion, 2004, Intelligent Information Systems.

Foreword

Guillaume Bonfante, Jean-Yves Marion, 2007, Journal in Computer Virology.

Evolving Graph-Structures and Their Implicit Computational Complexity

Daniel Leivant, Jean-Yves Marion, 2013, ICALP.

Scientific Foundations - Categorial Grammars and Dependency Grammars

François Lamarche, Lutz Straßburger, Bruno Guillaume, 2003 .

Learning Dependency Languages from a Teacher

Jean-Yves Marion, Jérôme Besombes, 2004 .

Complexity Information Flow in a Multi-threaded Imperative Language pdf

Jean-Yves Marion, Romain Péchoux, 2014, TAMC.

Developments in implicit computational complexity

Jean-Yves Marion, 2015, Inf. Comput..

A characterization of polynomial complexity classes using dependency pairs

Jean-Yves Marion, Romain Péchoux, 2007 .

Behavior Analysis of Malware by Rewriting-based Abstraction - Extended Version

Jean-Yves Marion, Philippe Beaucamps, Isabelle Gnaedig, 2011 .

On Abstract Computer Virology from a Recursion Theoretic Perspective

Guillaume Bonfante, Jean-Yves Marion, Matthieu Kaczmarek, 2006, Journal in Computer Virology.

Viruses in Turing's Garden

Jean-Yves Marion, 2012, ERCIM News.

Resource Analysis by Quasi-Interpretations

Jean-Yves Marion, 2004 .

Analysing the implicit complexity of programs

Jean-Yves Marion, J. Marion, 2003, Inf. Comput..

Architecture of a morphological malware detector

Guillaume Bonfante, Jean-Yves Marion, Matthieu Kaczmarek, 2009, Journal in Computer Virology.

Primitive recursion in the abstract

Daniel Leivant, Jean-Yves Marion, D. Leivant, 2020, Mathematical Structures in Computer Science.

Abstraction-Based Malware Analysis Using Rewriting and Model Checking

Jean-Yves Marion, Philippe Beaucamps, Isabelle Gnaedig, 2012, ESORICS.

Morphological detection of malware

Guillaume Bonfante, Jean-Yves Marion, Matthieu Kaczmarek, 2008, 2008 3rd International Conference on Malicious and Unwanted Software (MALWARE).

Editorial: Implicit Computational Complexity

Jean-Yves Marion, 2004, Theor. Comput. Sci..

Sound and Quasi-Complete Detection of Infeasible Test Requirements

Yves Le Traon, Nikolai Kosmatov, Jean-Yves Marion, 2015, 2015 IEEE 8th International Conference on Software Testing, Verification and Validation (ICST).

A characterization of alternating log time by ramified recurrence

Daniel Leivant, Jean-Yves Marion, 2000, Theor. Comput. Sci..

Preface: Special Issue on Theoretical Aspects of Computer Science (STACS)

Susanne Albers, Jean-Yves Marion, 2010, Theory of Computing Systems.

Theoretical Computer Science: Computability, Decidability and Logic

Gilles Dowek, Olivier Bournez, Simon Perdrix, 2020, A Guided Tour of Artificial Intelligence Research.

Quasi-interpretation: a way to control ressources

Jean-Yves Marion, Jean-Yves Moyen, Guillaume Bonfante, 2005 .

Theoretical Computer Science: Computational Complexity

Gilles Dowek, Olivier Bournez, Simon Perdrix, 2020, A Guided Tour of Artificial Intelligence Research.

Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time

Felipe Cucker, Olivier Bournez, Jean-Yves Marion, 2005, J. Log. Comput..

Kolmogorov complexity and non-determinism

Serge Grigorieff, Jean-Yves Marion, 2002, Theor. Comput. Sci..

Quasi-friendly sup-interpretations pdf

Jean-Yves Marion, Romain Péchoux, 2006, ArXiv.

Predicative Analysis of Feasibility and Diagonalization

Jean-Yves Marion, 2007, TLCA.

Towards an Implicit Characterization of NCk

Guillaume Bonfante, Jean-Yves Marion, Isabel Oitavem, 2006, CSL.

Editorial : Implicit Computational Complexity (ICC)

Jean-Yves Marion, 2004 .

Actual Arithmetic and Feasibility

Jean-Yves Marion, 2001, CSL.

Soft Linear Logic and Polynomial Complexity Classes

Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca, 2007, LSFA.

27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France

Thomas Schwentick, Jean-Yves Marion, 2010, STACS.

A Computability Perspective on Self-Modifying Programs

Guillaume Bonfante, Jean-Yves Marion, Daniel Reynaud-Plantey, 2009, 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods.

Proceedings Second Workshop on Developments in Implicit Computational Complexity: Preface

Jean-Yves Marion, 2012 .

The QSL platform at LORIA

Stephan Merz, Claude Kirchner, Hélène Kirchner, 2003 .

Control Flow Graphs as Malware Signatures

Guillaume Bonfante, Jean-Yves Marion, Matthieu Kaczmarek, 2007 .

Lambda Calculus Characterizations of Poly-Time

Daniel Leivant, Jean-Yves Marion, D. Leivant, 1993, Fundam. Informaticae.

Identification reversible dependency tree languages

Jean-Yves Marion, Jérôme Besombes, 2001 .

How to kill symbolic deobfuscation for free (or: unleashing the potential of path-oriented protections)

Jean-Yves Marion, Richard Bonichon, S'ebastien Bardin, 2019, ACSAC.

Dynamic Binary Instrumentation for Deobfuscation and Unpacking

Jean-Yves Marion, Daniel Reynaud, 2009 .

Binary level toolchain provenance identification with graph neural networks

Jean-Yves Marion, Sébastien Bardin, Tristan Benoit, 2021, 2021 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER).

Obfuscation-Resilient Executable Payload Extraction From Packed Malware

Jianming Fu, Jiang Ming, Jean-Yves Marion, 2021, USENIX Security Symposium.

Ramified Recurrence and Computational Complexity IV : Predicative Functionals and Poly-Space

Daniel Leivant, Jean-Yves Marion, 2000 .

Safe Recursion over an Arbitrary Structure: Deterministic Polynomial Time

Olivier Bournez, Jean-Yves Marion, Paulin Jacobé de Naurois, 2002 .

A characterization of NC k by first order functional programs

Jean-Yves Marion, Romain Péchoux, J. Marion, 2008 .

On complexity analysis by quasi-interpretation

Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen, 2004 .

An hierarchy of terminating algorithms with semantic interpretation termination proofs

Jean-Yves Marion, 1998 .