Jean-Yves Marion - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Publications with a 'Jean-Yves Marion' as author, editor, or advisor:

Lambda calculus characterizations of poly-timeDaniel Leivant, Jean-Yves Marion. tlca 1993: 274-288
Learning reversible categorial grammars from structuresJérôme Besombes, Jean-Yves Marion. iiswc 2004: 181-190
A logical account of pspaceMarco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca. POPL 2008: 121-131 [doi]
27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, FranceJean-Yves Marion, Thomas Schwentick, editors, Volume 5 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2010.
k boolean circuitsGuillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem. iandc, 248:82-103, 2016. [doi]
A Classification of Viruses Through Recursion TheoremsGuillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion. cie 2007: 73-82 [doi]
Preface: Special Issue on Theoretical Aspects of Computer Science (STACS)Susanne Albers, Jean-Yves Marion. mst, 48(3):443, 2011. [doi]
Preface - 26th International Symposium on Theoretical Aspects of Computer ScienceSusanne Albers, Jean-Yves Marion. STACS 2009: [doi]
Type-Based Complexity Analysis for Fork ProcessesEmmanuel Hainry, Jean-Yves Marion, Romain Péchoux. fossacs 2013: 305-320 [doi]
Learning tree languages from positive examples and membership queriesJérôme Besombes, Jean-Yves Marion. TCS, 382(3):183-197, 2007. [doi]
Resource Analysis by Sup-interpretationJean-Yves Marion, Romain Péchoux. FLOPS 2006: 163-176 [doi]
An Implicit Characterization of PSPACEMarco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca. tocl, 13(2):18, 2012. [doi]
Efficient First Order Functional Program Interpreter with Time Bound CertificationsJean-Yves Marion, Jean-Yves Moyen. lpar 2000: 25-42 [doi]
A construction of a self-modifiying language with a formal correction proofGuillaume Bonfante, Hubert Godfroy, Jean-Yves Marion. malware 2017: 99-106 [doi]
Specification of concretization and symbolization policies in symbolic executionRobin David, Sébastien Bardin, Josselin Feist, Laurent Mounier, Marie-Laure Potet, Thanh Dinh Ta, Jean-Yves Marion. ISSTA 2016: 36-46 [doi]
From Multiple Sequent for Additive Linear Logic to Decision Procedures for Free LatticesJean-Yves Marion. TCS, 224(1-2):157-172, 1999. [doi]
On the defence notionAnne Bonfante, Jean-Yves Marion. virology, 3(4):247-251, 2007. [doi]
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial TimeOlivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion. logcom, 15(1):41-58, 2005. [doi]
Complexity Information Flow in a Multi-threaded Imperative LanguageJean-Yves Marion, Romain Péchoux. tamc 2014: 124-140 [doi]
Towards Paving the Way for Large-Scale Windows Malware Analysis: Generic Binary Unpacking with Orders-of-Magnitude Performance BoostBinlin Cheng, Jiang Ming 0002, Jianming Fu, Guojun Peng, Ting Chen 0002, Xiaosong Zhang, Jean-Yves Marion. ccs 2018: 395-411 [doi]
On Abstract Computer Virology from a Recursion Theoretic PerspectiveGuillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion. virology, 1(3-4):45-54, 2006. [doi]
Kolmogorov complexity and non-determinismSerge Grigorieff, Jean-Yves Marion. TCS, 271(1-2):151-180, 2002. [doi]
Predicative Analysis of Feasibility and DiagonalizationJean-Yves Marion. tlca 2007: 290-304 [doi]
Computers under Attacks!Anne Bonfante, Jean-Yves Marion. caise 2007: [doi]
Complete and tractable machine-independent characterizations of second-order polytimeEmmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux. fossacs 2022: 368-388 [doi]
Server-side dynamic code analysisWadie Guizani, Jean-Yves Marion, Daniel Reynaud-Plantey. malware 2009: 55-62 [doi]
Foundations and Practice of Security - 13th International Symposium, FPS 2020, Montreal, QC, Canada, December 1-3, 2020, Revised Selected PapersGabriela Nicolescu, Assia Tria, José M. Fernandez 0001, Jean-Yves Marion, Joaquín García-Alfaro, editors, Volume 12637 of Lecture Notes in Computer Science, Springer, 2021. [doi]
On Lexicographic Termination Ordering with Space Bound CertificationsGuillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen. ershov 2001: 482-493 [doi]
Toward an Abstract Computer VirologyGuillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion. ictac 2005: 579-593 [doi]
Abstraction-Based Malware Analysis Using Rewriting and Model CheckingPhilippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion. esorics 2012: 806-823 [doi]
Learning Tree Languages from Positive Examples and Membership QueriesJérôme Besombes, Jean-Yves Marion. alt 2004: 440-453 [doi]
Obfuscation-Resilient Executable Payload Extraction From Packed MalwareBinlin Cheng, Jiang Ming 0002, Erika A. Leal, Haotian Zhang, Jianming Fu, Guojun Peng, Jean-Yves Marion. uss 2021: 3451-3468 [doi]
Malware Message Classification by Dynamic AnalysisGuillaume Bonfante, Jean-Yves Marion, Thanh Dinh Ta. fps 2015: 112-128 [doi]
Analysis and diversion of Duqu's driverGuillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurelien Thierry. malware 2013: 109-115 [doi]
Learning discrete categorial grammars from structuresJÃ©rÃ´me Besombes, Jean-Yves Marion. ita, 42(1):165-182, 2008. [doi]
A Computability Perspective on Self-Modifying ProgramsGuillaume Bonfante, Jean-Yves Marion, Daniel Reynaud-Plantey. SEFM 2009: 231-239 [doi]
Analyzing the Implicit Computational Complexity of object-oriented programsJean-Yves Marion, Romain Péchoux. fsttcs 2008: 316-327 [doi]
Foundations and Practice of Security - 10th International Symposium, FPS 2017, Nancy, France, October 23-25, 2017, Revised Selected PapersAbdessamad Imine, José M. Fernandez, Jean-Yves Marion, Luigi Logrippo, Joaquín García-Alfaro, editors, Volume 10723 of Lecture Notes in Computer Science, Springer, 2018. [doi]
A Characterization of Alternating Log Time by First Order Functional ProgramsGuillaume Bonfante, Jean-Yves Marion, Romain Péchoux. lpar 2006: 90-104 [doi]
Table of Contents - 27th International Symposium on Theoretical Aspects of Computer ScienceJean-Yves Marion, Thomas Schwentick. STACS 2010: 7-10 [doi]
Architecture of a morphological malware detectorGuillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion. virology, 5(3):263-270, 2009. [doi]
Implicit Computational Complexity and Applications: Resource Control, Security, Real-Number Computation (NII Shonan Meeting 2013-13)Akitoshi Kawamura, Jean-Yves Marion, David Nowak. shonan-reports, 2013, 2013. [doi]
A tier-based typed programming language characterizing Feasible FunctionalsEmmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux. lmcs, 18(1), 2022. [doi]
26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, ProceedingsSusanne Albers, Jean-Yves Marion, editors, Volume 09001 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2009. [doi]
Scalable Program Clone Search through Spectral AnalysisTristan Benoit, Jean-Yves Marion, Sébastien Bardin. FSE 2023: 808-820 [doi]
Binary level toolchain provenance identification with graph neural networksTristan Benoit, Jean-Yves Marion, Sébastien Bardin. WCRE 2021: 131-141 [doi]
Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof AssistantsPascal Fontaine, Jean-Yves Marion, Stephan Merz, Leonor Prensa Nieto, Alwen Fernanto Tiu. TACAS 2006: 167-181 [doi]
Evolving Graph-Structures and Their Implicit Computational ComplexityDaniel Leivant, Jean-Yves Marion. icalp 2013: 349-360 [doi]
Quasi-interpretations and Small Space BoundsGuillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen. RTA 2005: 150-164 [doi]
Foundations and Practice of Security - 6th International Symposium, FPS 2013, La Rochelle, France, October 21-22, 2013, Revised Selected PapersJean-Luc Danger, Mourad Debbabi, Jean-Yves Marion, Joaquín García-Alfaro, A. Nur Zincir-Heywood, editors, Volume 8352 of Lecture Notes in Computer Science, Springer, 2014. [doi]
Predicative Functional Recurrence and Poly-spaceDaniel Leivant, Jean-Yves Marion. tapsoft 1997: 369-380
CoDisasm: Medium Scale Concatic Disassembly of Self-Modifying Binaries with Overlapping InstructionsGuillaume Bonfante, José M. Fernandez, Jean-Yves Marion, Benjamin Rouxel, Fabrice Sabatier, Aurélien Thierry. ccs 2015: 745-756 [doi]
Sup-interpretations, a semantic method for static analysis of program resourcesJean-Yves Marion, Romain PÃ©choux. tocl, 10(4), 2009. [doi]
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial TimeOlivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion. fossacs 2003: 185-199 [doi]
Complexity Classes and Rewrite Systems with Polynomial InterpretationGuillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet. csl 1999: 372-384
ForewordGuillaume Bonfante, Jean-Yves Marion. virology, 3(1):1-2, 2007. [doi]
Morphological detection of malwareGuillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion. malware 2008: 1-8 [doi]
Analysing the implicit complexity of programsJean-Yves Marion. iandc, 183(1):2-18, 2003. [doi]
Algorithms with polynomial interpretation termination proofGuillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet. JFP, 11(1):33-53, 2001.
Ramified Recurrence and Computational Complexity II: Substitution and Poly-SpaceDaniel Leivant, Jean-Yves Marion. csl 1995: 486-500
Editorial: Implicit Computational ComplexityJean-Yves Marion. TCS, 318(1-2):1, 2004. [doi]
Recursion Schemata for NCkGuillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem. csl 2008: 49-63 [doi]
Theoretical Aspects of Computer ScienceJean-Yves Marion, Thomas Schwentick. mst, 51(2):123-124, 2012. [doi]
Soft Linear Logic and Polynomial Complexity ClassesMarco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca. ENTCS, 205:67-87, 2008. [doi]
Sound and Quasi-Complete Detection of Infeasible Test RequirementsSébastien Bardin, Mickaël Delahaye, Robin David, Nikolai Kosmatov, Mike Papadakis, Yves Le Traon, Jean-Yves Marion. icst 2015: 1-10 [doi]
Low level code analysis and applications to computer security (NII Shonan Meeting 2015-4)Jean-Yves Marion, Akira Mori, Mizuhito Ogawa. shonan-reports, 2015, 2015. [doi]
Aligot: cryptographic function identification in obfuscated binary programsJoan Calvet, José M. Fernandez, Jean-Yves Marion. ccs 2012: 169-182 [doi]
Behavior Abstraction in Malware AnalysisPhilippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion. RV 2010: 168-182 [doi]
Developments in implicit computational complexityJean-Yves Marion. iandc, 241:1-2, 2015. [doi]
A characterization of alternating log time by ramified recurrenceDaniel Leivant, Jean-Yves Marion. TCS, 236(1-2):193-208, 2000. [doi]
Code synchronization by morphological analysisGuillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurelien Thierry. malware 2012: 112-119 [doi]
Safe Recursion Over an Arbitrary Structure: PAR, PH and DPHOlivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion. ENTCS, 90(1):3-14, 2003. [doi]
Gorille sniffs code similarities, the case study of qwerty versus reginGuillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier. malware 2015: 82-89 [doi]
Case Study: Additive Linear Logic and LatticesJean-Yves Marion. lfcs 1997: 237-247
Implicit complexity over an arbitrary structure: Quantifier alternationsOlivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion. iandc, 204(2):210-230, 2006. [doi]
Guest editorial: Special issue on implicit computational complexityPatrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca. tocl, 10(4), 2009. [doi]
Quasi-interpretation Synthesis by DecompositionGuillaume Bonfante, Jean-Yves Marion, Romain Péchoux. ictac 2007: 410-424 [doi]
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: 177-189 [doi]
BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level AnalysisRobin David, Sébastien Bardin, Thanh Dinh Ta, Laurent Mounier, Josselin Feist, Marie-Laure Potet, Jean-Yves Marion. WCRE 2016: 653-656 [doi]
A tier-based typed programming language characterizing Feasible FunctionalsEmmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion, Romain Péchoux. lics 2020: 535-549 [doi]
Backward-Bounded DSE: Targeting Infeasibility Questions on Obfuscated CodesSébastien Bardin, Robin David, Jean-Yves Marion. sp 2017: 633-651 [doi]
Towards an Implicit Characterization of ::::NC:::::::::::k:::::::Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem. csl 2006: 212-224 [doi]
Learning languages from positive examples with dependenciesJérôme Besombes, Jean-Yves Marion. tag 2002: 25-29 [doi]
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary StructuresOlivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion. ifipTCS 2004: 409-422
Isolated Virtualised Clusters: Testbeds for High-Risk Security Experimentation and TrainingJoan Calvet, Carlton R. Davis, José M. Fernandez, Wadie Guizani, Matthieu Kaczmarek, Jean-Yves Marion, Pier-Luc St-Onge. uss 2010: [doi]
Actual Arithmetic and FeasibilityJean-Yves Marion. csl 2001: 115-129 [doi]
Characterizations of polynomial complexity classes with a better intensionalityJean-Yves Marion, Romain Péchoux. ppdp 2008: 79-88 [doi]
Primitive recursion in the abstractDaniel Leivant, Jean-Yves Marion. mscs, 30(1):33-43, 2020. [doi]
A Characterization of NCkJean-Yves Marion, Romain Péchoux. tamc 2008: 136-147 [doi]
Lambda Calculus Characterizations of Poly-TimeDaniel Leivant, Jean-Yves Marion. FUIN, 19(1/2):167-184, 1993.
Gorille: Efficient and Relevant Software ComparisonsPhilippe Antoine, Guillaume Bonfante, Jean-Yves Marion. ercim, 2016(106), 2016. [doi]
Viruses in Turing's GardenJean-Yves Marion. ercim, 2012(91), 2012. [doi]
The case for in-the-lab botnet experimentation: creating and taking down a 3000-node botnetJoan Calvet, Carlton R. Davis, José M. Fernandez, Jean-Yves Marion, Pier-Luc St-Onge, Wadie Guizani, Pierre-Marc Bureau, Anil Somayaji. acsac 2010: 141-150 [doi]

runs on WebDSL