Jean-Yves Marion

119 papers A* 10A 13B 14C 6Misc 2Journal 46Unranked 22
YearRankTypeTitle / Venue / Authors
2025 A* conf
Augmenting Search-based Program Synthesis with Local Inference Rules to Improve Black-box Deobfuscation.
CCS
Vidal Attias, Nicolas Bellec, Grégoire Menguy, Sébastien Bardin, Jean-Yves Marion
2025 J jnl
Complete and tractable machine-independent characterizations of second-order polytime.
Log. Methods Comput. Sci.
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2025 J jnl
Ransomware: Extortion Is My Business.
Commun. ACM
Jean-Yves Marion
2024 A* conf
Declassification Policy for Program Complexity Analysis.
LICS
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2024 J jnl
Declassification Policy for Program Complexity Analysis.
CoRR
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2024 B conf
Trace Partitioning as an Optimization Problem.
SAS
M. Charles Babu, Matthieu Lemerre, Sébastien Bardin, Jean-Yves Marion
2023 — conf
Scalable Program Clone Search through Spectral Analysis.
ESEC/SIGSOFT FSE
Tristan Benoit, Jean-Yves Marion, Sébastien Bardin
2022 J jnl
A tier-based typed programming language characterizing Feasible Functionals.
Log. Methods Comput. Sci.
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2022 B conf
Complete and tractable machine-independent characterizations of second-order polytime.
FoSSaCS
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2022 J jnl
Complete and tractable machine-independent characterizations of second-order polytime.
CoRR
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2022 J jnl
Scalable Program Clone Search Through Spectral Analysis.
CoRR
Tristan Benoit, Jean-Yves Marion, Sébastien Bardin
2021 J jnl
A tier-based typed programming language characterizing Feasible Functionals.
CoRR
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2021 A conf
Binary level toolchain provenance identification with graph neural networks.
SANER
Tristan Benoit, Jean-Yves Marion, Sébastien Bardin
2021 — ed.
Foundations and Practice of Security - 13th International Symposium, FPS 2020, Montreal, QC, Canada, December 1-3, 2020, Revised Selected Papers
FPS
Gabriela Nicolescu, Assia Tria, José M. Fernandez, Jean-Yves Marion, Joaquín García-Alfaro
2021 A* conf
Obfuscation-Resilient Executable Payload Extraction From Packed Malware.
USENIX Security Symposium
Binlin Cheng, Jiang Ming, Erika A. Leal, Haotian Zhang, Jianming Fu, Guojun Peng, Jean-Yves Marion
2020 A* conf
A tier-based typed programming language characterizing Feasible Functionals.
LICS
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux
2020 J jnl
Primitive recursion in the abstract.
Math. Struct. Comput. Sci.
Daniel Leivant, Jean-Yves Marion
2020 — ch.
Theoretical Computer Science: Computability, Decidability and Logic.
A Guided Tour of Artificial Intelligence Research (3) (III)
Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, Sophie Tison
2020 — ch.
Theoretical Computer Science: Computational Complexity.
A Guided Tour of Artificial Intelligence Research (3) (III)
Olivier Bournez, Gilles Dowek, Rémi Gilleron, Serge Grigorieff, Jean-Yves Marion, Simon Perdrix, Sophie Tison
2019 J jnl
How to Kill Symbolic Deobfuscation for Free; or Unleashing the Potential of Path-Oriented Protections.
CoRR
Mathilde Ollivier, Sébastien Bardin, Richard Bonichon, Jean-Yves Marion
2019 A conf
How to kill symbolic deobfuscation for free (or: unleashing the potential of path-oriented protections).
ACSAC
Mathilde Ollivier, Sébastien Bardin, Richard Bonichon, Jean-Yves Marion
2018 — ed.
Foundations and Practice of Security - 10th International Symposium, FPS 2017, Nancy, France, October 23-25, 2017, Revised Selected Papers
FPS
Abdessamad Imine, José M. Fernandez, Jean-Yves Marion, Luigi Logrippo, Joaquín García-Alfaro
2018 J jnl
Implicit complexity via structure transformation.
CoRR
Daniel Leivant, Jean-Yves Marion
2018 A* conf
Towards Paving the Way for Large-Scale Windows Malware Analysis: Generic Binary Unpacking with Orders-of-Magnitude Performance Boost.
CCS
Binlin Cheng, Jiang Ming, Jianming Fu, Guojun Peng, Ting Chen, Xiaosong Zhang, Jean-Yves Marion
2017 — conf
A construction of a self-modifiying language with a formal correction proof.
MALWARE
Guillaume Bonfante, Hubert Godfroy, Jean-Yves Marion
2017 A* conf
Backward-Bounded DSE: Targeting Infeasibility Questions on Obfuscated Codes.
IEEE Symposium on Security and Privacy
Sébastien Bardin, Robin David, Jean-Yves Marion
2016 A conf
BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level Analysis.
SANER
Robin David, Sébastien Bardin, Thanh Dinh Ta, Laurent Mounier, Josselin Feist, Marie-Laure Potet, Jean-Yves Marion
2016 J jnl
Gorille: Efficient and Relevant Software Comparisons.
ERCIM News
Philippe Antoine, Guillaume Bonfante, Jean-Yves Marion
2016 A conf
Specification of concretization and symbolization policies in symbolic execution.
ISSTA
Robin David, Sébastien Bardin, Josselin Feist, Laurent Mounier, Marie-Laure Potet, Thanh Dinh Ta, Jean-Yves Marion
2016 J jnl
Targeting Infeasibility Questions on Obfuscated Codes.
CoRR
Robin David, Sébastien Bardin, Jean-Yves Marion
2016 J jnl
Two function algebras defining functions in NC
Inf. Comput.
Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem
2015 A* conf
CoDisasm: Medium Scale Concatic Disassembly of Self-Modifying Binaries with Overlapping Instructions.
CCS
Guillaume Bonfante, José M. Fernandez, Jean-Yves Marion, Benjamin Rouxel, Fabrice Sabatier, Aurélien Thierry
2015 J jnl
Developments in implicit computational complexity.
Inf. Comput.
Jean-Yves Marion
2015 — conf
Gorille sniffs code similarities, the case study of qwerty versus regin.
MALWARE
Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier
2015 J jnl
Low level code analysis and applications to computer security (NII Shonan Meeting 2015-4).
NII Shonan Meet. Rep.
Jean-Yves Marion, Akira Mori, Mizuhito Ogawa
2015 A conf
Sound and Quasi-Complete Detection of Infeasible Test Requirements.
ICST
Sébastien Bardin, Mickaël Delahaye, Robin David, Nikolai Kosmatov, Mike Papadakis, Yves Le Traon, Jean-Yves Marion
2014 J jnl
Analysis and Diversion of Duqu's Driver.
CoRR
Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurélien Thierry
2014 C conf
Complexity Information Flow in a Multi-threaded Imperative Language.
TAMC
Jean-Yves Marion, Romain Péchoux
2014 — ed.
Foundations and Practice of Security - 6th International Symposium, FPS 2013, La Rochelle, France, October 21-22, 2013, Revised Selected Papers
FPS
Jean-Luc Danger, Mourad Debbabi, Jean-Yves Marion, Joaquín García-Alfaro, Nur Zincir-Heywood
2014 — conf
Malware Message Classification by Dynamic Analysis.
FPS
Guillaume Bonfante, Jean-Yves Marion, Thanh Dinh Ta
2013 — conf
Analysis and diversion of Duqu's driver.
MALWARE
Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurélien Thierry
2013 — conf
Evolving Graph-Structures and Their Implicit Computational Complexity.
ICALP (2)
Daniel Leivant, Jean-Yves Marion
2013 J jnl
Implicit Computational Complexity and Applications: Resource Control, Security, Real-Number Computation (NII Shonan Meeting 2013-13).
NII Shonan Meet. Rep.
Akitoshi Kawamura, Jean-Yves Marion, David Nowak
2013 B conf
Type-Based Complexity Analysis for Fork Processes.
FoSSaCS
Emmanuel Hainry, Jean-Yves Marion, Romain Péchoux
2012 A conf
Abstraction-Based Malware Analysis Using Rewriting and Model Checking.
ESORICS
Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion
2012 A* conf
Aligot: cryptographic function identification in obfuscated binary programs.
CCS
Joan Calvet, José M. Fernandez, Jean-Yves Marion
2012 J jnl
An Implicit Characterization of PSPACE.
ACM Trans. Comput. Log.
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca
2012 — conf
Code synchronization by morphological analysis.
MALWARE
Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurélien Thierry
2012 J jnl
Complexity Information Flow in a Multi-threaded Imperative Language
CoRR
Jean-Yves Marion, Romain Péchoux
2012 J jnl
Theoretical Aspects of Computer Science.
Theory Comput. Syst.
Jean-Yves Marion, Thomas Schwentick
2012 J jnl
Viruses in Turing's Garden.
ERCIM News
Jean-Yves Marion
2011 A* conf
A Type System for Complexity Flow Analysis.
LICS
Jean-Yves Marion
2011 J jnl
Preface: Special Issue on Theoretical Aspects of Computer Science (STACS).
Theory Comput. Syst.
Susanne Albers, Jean-Yves Marion
2011 — ed.
Proceedings Second Workshop on Developments in Implicit Computational Complexity, Saarbrücken, DICE 2011, Germany, April 2nd and 3rd, 2011.
DICE
Jean-Yves Marion
2011 J jnl
Quasi-interpretations a way to control resources.
Theor. Comput. Sci.
Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen
2010 A ed.
27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, Nancy, France, March 4-6, 2010
STACS
Jean-Yves Marion, Thomas Schwentick
2010 J jnl
An Implicit Characterization of PSPACE
CoRR
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca
2010 B conf
Behavior Abstraction in Malware Analysis.
RV
Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion
2010 A conf
Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science.
STACS
Jean-Yves Marion, Thomas Schwentick
2010 — conf
Isolated Virtualised Clusters: Testbeds for High-Risk Security Experimentation and Training.
CSET
Joan Calvet, Carlton R. Davis, José M. Fernandez, Wadie Guizani, Matthieu Kaczmarek, Jean-Yves Marion, Pier-Luc St-Onge
2010 A conf
Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science.
STACS
Jean-Yves Marion, Thomas Schwentick
2010 A conf
The case for in-the-lab botnet experimentation: creating and taking down a 3000-node botnet.
ACSAC
Joan Calvet, Carlton R. Davis, José M. Fernandez, Jean-Yves Marion, Pier-Luc St-Onge, Wadie Guizani, Pierre-Marc Bureau, Anil Somayaji
2009 B conf
A Computability Perspective on Self-Modifying Programs.
SEFM
Guillaume Bonfante, Jean-Yves Marion, Daniel Reynaud-Plantey
2009 J jnl
Architecture of a morphological malware detector.
J. Comput. Virol.
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
2009 J jnl
Guest editorial: Special issue on implicit computational complexity.
ACM Trans. Comput. Log.
Patrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca
2009 J jnl
On tiered small jump operators
Log. Methods Comput. Sci.
Jean-Yves Marion
2009 A conf
Preface - 26th International Symposium on Theoretical Aspects of Computer Science.
STACS
Susanne Albers, Jean-Yves Marion
2009 A ed.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, Freiburg, Germany, February 26-28, 2009
STACS
Susanne Albers, Jean-Yves Marion
2009 — conf
Server-side dynamic code analysis.
MALWARE
Wadie Guizani, Jean-Yves Marion, Daniel Reynaud-Plantey
2009 J jnl
Sup-interpretations, a semantic method for static analysis of program resources.
ACM Trans. Comput. Log.
Jean-Yves Marion, Romain Péchoux
2008 C conf
A Characterization of NCk.
TAMC
Jean-Yves Marion, Romain Péchoux
2008 A* conf
A logical account of pspace.
POPL
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca
2008 — conf
Analyzing the Implicit Computational Complexity of object-oriented programs.
FSTTCS
Jean-Yves Marion, Romain Péchoux
2008 C conf
Characterizations of polynomial complexity classes with a better intensionality.
PPDP
Jean-Yves Marion, Romain Péchoux
2008 J jnl
Learning discrete categorial grammars from structures.
RAIRO Theor. Informatics Appl.
Jérôme Besombes, Jean-Yves Marion
2008 — conf
Morphological detection of malware.
MALWARE
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
2008 B conf
Recursion Schemata for NCk.
CSL
Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem
2007 C conf
A Classification of Viruses Through Recursion Theorems.
CiE
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
2007 J jnl
Foreword.
J. Comput. Virol.
Guillaume Bonfante, Jean-Yves Marion
2007 J jnl
Learning tree languages from positive examples and membership queries.
Theor. Comput. Sci.
Jérôme Besombes, Jean-Yves Marion
2007 J jnl
On the defence notion
CoRR
Anne Bonfante, Jean-Yves Marion
2007 J jnl
On the defence notion.
J. Comput. Virol.
Anne Bonfante, Jean-Yves Marion
2007 — conf
Predicative Analysis of Feasibility and Diagonalization.
TLCA
Jean-Yves Marion
2007 C conf
Quasi-interpretation Synthesis by Decomposition.
ICTAC
Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux
2007 J jnl
Resource control of object-oriented programs
CoRR
Jean-Yves Marion, Romain Péchoux
2007 — conf
Soft Linear Logic and Polynomial Complexity Classes.
LSFA
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca
2006 B conf
A Characterization of Alternating Log Time by First Order Functional Programs.
LPAR
Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux
2006 — conf
Computers under Attacks!
PhiSE
Anne Bonfante, Jean-Yves Marion
2006 A conf
Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants.
TACAS
Pascal Fontaine, Jean-Yves Marion, Stephan Merz, Leonor Prensa Nieto, Alwen Fernanto Tiu
2006 J jnl
Implicit complexity over an arbitrary structure: Quantifier alternations.
Inf. Comput.
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
2006 J jnl
On Abstract Computer Virology from a Recursion Theoretic Perspective.
J. Comput. Virol.
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
2006 J jnl
Quasi-friendly sup-interpretations
CoRR
Jean-Yves Marion, Romain Péchoux
2006 Misc conf
Resource Analysis by Sup-interpretation.
FLOPS
Jean-Yves Marion, Romain Péchoux
2006 B conf
Towards an Implicit Characterization of
CSL
Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem
2005 J jnl
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time.
J. Log. Comput.
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
2005 — conf
Quasi-interpretations and Small Space Bounds.
RTA
Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen
2005 C conf
Toward an Abstract Computer Virology.
ICTAC
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
2004 J jnl
Editorial: Implicit Computational Complexity.
Theor. Comput. Sci.
Jean-Yves Marion
2004 B conf
Learning Tree Languages from Positive Examples and Membership Queries.
ALT
Jérôme Besombes, Jean-Yves Marion
2004 — conf
Learning reversible categorial grammars from structures.
Intelligent Information Systems
Jérôme Besombes, Jean-Yves Marion
2004 — conf
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures.
IFIP TCS
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
2003 J jnl
Analysing the implicit complexity of programs.
Inf. Comput.
Jean-Yves Marion
2003 B conf
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time.
FoSSaCS
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
2003 — conf
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH.
ICC@LICS
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion
2002 J jnl
Kolmogorov complexity and non-determinism.
Theor. Comput. Sci.
Serge Grigorieff, Jean-Yves Marion
2002 — conf
Learning languages from positive examples with dependencies.
TAG+
Jérôme Besombes, Jean-Yves Marion
2001 B conf
Actual Arithmetic and Feasibility.
CSL
Jean-Yves Marion
2001 J jnl
Algorithms with polynomial interpretation termination proof.
J. Funct. Program.
Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet
2001 — conf
On Lexicographic Termination Ordering with Space Bound Certifications.
Ershov Memorial Conference
Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen
2000 J jnl
A characterization of alternating log time by ramified recurrence.
Theor. Comput. Sci.
Daniel Leivant, Jean-Yves Marion
2000 B conf
Efficient First Order Functional Program Interpreter with Time Bound Certifications.
LPAR
Jean-Yves Marion, Jean-Yves Moyen
2000 J jnl
The Light Lexicographic path Ordering
CoRR
E. A. Cichon, Jean-Yves Marion
1999 J jnl
From Multiple Sequent for Additive Linear Logic to Decision Procedures for Free Lattices.
Theor. Comput. Sci.
Jean-Yves Marion
1998 B conf
Complexity Classes and Rewrite Systems with Polynomial Interpretation.
CSL
Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet
1997 Misc conf
Case Study: Additive Linear Logic and Lattices.
LFCS
Jean-Yves Marion
1997 — conf
Predicative Functional Recurrence and Poly-space.
TAPSOFT
Daniel Leivant, Jean-Yves Marion
1994 B conf
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space.
CSL
Daniel Leivant, Jean-Yves Marion
1993 J jnl
Lambda Calculus Characterizations of Poly-Time.
Fundam. Informaticae
Daniel Leivant, Jean-Yves Marion
1993 — conf
Lambda calculus characterizations of poly-time.
TLCA
Daniel Leivant, Jean-Yves Marion