Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jean-Yves Marion
2010 – today
- 2013
[c41]Emmanuel Hainry, Jean-Yves Marion, Romain Péchoux: Type-Based Complexity Analysis for Fork Processes. FoSSaCS 2013: 305-320- [c40]Daniel Leivant, Jean-Yves Marion: Evolving Graph-Structures and Their Implicit Computational Complexity. ICALP (2) 2013: 349-360
- 2012
- [j25]
- [j24]Jean-Yves Marion, Thomas Schwentick: Theoretical Aspects of Computer Science. Theory Comput. Syst. 51(2): 123-124 (2012)
- [j23]Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca: An Implicit Characterization of PSPACE. ACM Trans. Comput. Log. 13(2): 18 (2012)
- [c39]Joan Calvet, José M. Fernandez, Jean-Yves Marion: Aligot: cryptographic function identification in obfuscated binary programs. ACM Conference on Computer and Communications Security 2012: 169-182
- [c38]Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion: Abstraction-Based Malware Analysis Using Rewriting and Model Checking. ESORICS 2012: 806-823
- [c37]Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurelien Thierry: Code synchronization by morphological analysis. MALWARE 2012: 112-119
- [i6]Jean-Yves Marion, Romain Péchoux: Complexity Information Flow in a Multi-threaded Imperative Language. CoRR abs/1203.6878 (2012)
- 2011
- [j22]Susanne Albers, Jean-Yves Marion: Preface: Special Issue on Theoretical Aspects of Computer Science (STACS). Theory Comput. Syst. 48(3): 443 (2011)
- [j21]Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen: Quasi-interpretations a way to control resources. Theor. Comput. Sci. 412(25): 2776-2796 (2011)
- [c36]
- [e3]
- 2010
- [c35]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: 141-150
- [c34]Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion: Behavior Abstraction in Malware Analysis. RV 2010: 168-182
- [c33]Jean-Yves Marion, Thomas Schwentick: Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science. STACS 2010: 1-6
- [c32]Jean-Yves Marion, Thomas Schwentick: Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science. STACS 2010: 7-10
- [e2]Jean-Yves Marion, Thomas Schwentick (Eds.): 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France. LIPIcs 5, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2010, ISBN 978-3-939897-16-3
- [i5]Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca: An Implicit Characterization of PSPACE. CoRR abs/1006.0030 (2010)
2000 – 2009
- 2009
- [j20]
- [j19]Patrick Baillot, Jean-Yves Marion, Simona Ronchi Della Rocca: Guest editorial: Special issue on implicit computational complexity. ACM Trans. Comput. Log. 10(4) (2009)
- [j18]Jean-Yves Marion, Romain Péchoux: Sup-interpretations, a semantic method for static analysis of program resources. ACM Trans. Comput. Log. 10(4) (2009)
- [j17]Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion: Architecture of a morphological malware detector. Journal in Computer Virology 5(3): 263-270 (2009)
- [c31]Wadie Guizani, Jean-Yves Marion, Daniel Reynaud-Plantey: Server-side dynamic code analysis. MALWARE 2009: 55-62
- [c30]Guillaume Bonfante, Jean-Yves Marion, Daniel Reynaud-Plantey: A Computability Perspective on Self-Modifying Programs. SEFM 2009: 231-239
- [c29]Susanne Albers, Jean-Yves Marion: Preface - 26th International Symposium on Theoretical Aspects of Computer Science. STACS 2009: 0-
- [e1]Susanne Albers, Jean-Yves Marion (Eds.): 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings. LIPIcs 3, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2009, ISBN 978-3-939897-09-5
- 2008
- [j16]Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca: Soft Linear Logic and Polynomial Complexity Classes. Electr. Notes Theor. Comput. Sci. 205: 67-87 (2008)
- [j15]Jérôme Besombes, Jean-Yves Marion: Learning discrete categorial grammars from structures. ITA 42(1): 165-182 (2008)
- [c28]Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem: Recursion Schemata for NCk. CSL 2008: 49-63
- [c27]Jean-Yves Marion, Romain Péchoux: Analyzing the Implicit Computational Complexity of object-oriented programs. FSTTCS 2008: 316-327
- [c26]Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion: Morphological detection of malware. MALWARE 2008: 1-8
- [c25]Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca: A logical account of pspace. POPL 2008: 121-131
- [c24]Jean-Yves Marion, Romain Péchoux: Characterizations of polynomial complexity classes with a better intensionality. PPDP 2008: 79-88
- [c23]
- 2007
- [j14]Jérôme Besombes, Jean-Yves Marion: Learning tree languages from positive examples and membership queries. Theor. Comput. Sci. 382(3): 183-197 (2007)
- [j13]
- [j12]Anne Bonfante, Jean-Yves Marion: On the defence notion. Journal in Computer Virology 3(4): 247-251 (2007)
- [c22]Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion: A Classification of Viruses Through Recursion Theorems. CiE 2007: 73-82
- [c21]Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux: Quasi-interpretation Synthesis by Decomposition. ICTAC 2007: 410-424
- [c20]
- [i4]Jean-Yves Marion, Romain Péchoux: Resource control of object-oriented programs. CoRR abs/0706.2293 (2007)
- [i3]
- 2006
- [j11]Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion: Implicit complexity over an arbitrary structure: Quantifier alternations. Inf. Comput. 204(2): 210-230 (2006)
- [j10]Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion: On Abstract Computer Virology from a Recursion Theoretic Perspective. Journal in Computer Virology 1(3-4): 45-54 (2006)
- [c19]
- [c18]Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem: Towards an Implicit Characterization of NCk. CSL 2006: 212-224
- [c17]
- [c16]Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux: A Characterization of Alternating Log Time by First Order Functional Programs. LPAR 2006: 90-104
- [c15]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: 167-181
- [i2]
- 2005
- [j9]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): 41-58 (2005)
- [c14]Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion: Toward an Abstract Computer Virology. ICTAC 2005: 579-593
- [c13]Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen: Quasi-interpretations and Small Space Bounds. RTA 2005: 150-164
- 2004
- [j8]Jean-Yves Marion: Editorial: Implicit Computational Complexity. Theor. Comput. Sci. 318(1-2): 1 (2004)
- [c12]Jérôme Besombes, Jean-Yves Marion: Learning Tree Languages from Positive Examples and Membership Queries. ALT 2004: 440-453
- [c11]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: 409-422
- [c10]Jérôme Besombes, Jean-Yves Marion: Learning reversible categorial grammars from structures. Intelligent Information Systems 2004: 181-190
- 2003
- [j7]Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion: Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH. Electr. Notes Theor. Comput. Sci. 90: 3-14 (2003)
- [j6]
- [c9]Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion: Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. FoSSaCS 2003: 185-199
- 2002
- [j5]Serge Grigorieff, Jean-Yves Marion: Kolmogorov complexity and non-determinism. Theor. Comput. Sci. 271(1-2): 151-180 (2002)
- 2001
- [j4]Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet: Algorithms with polynomial interpretation termination proof. J. Funct. Program. 11(1): 33-53 (2001)
- [c8]
- [c7]Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen: On Lexicographic Termination Ordering with Space Bound Certifications. Ershov Memorial Conference 2001: 482-493
- 2000
- [j3]Daniel Leivant, Jean-Yves Marion: A characterization of alternating log time by ramified recurrence. Theor. Comput. Sci. 236(1-2): 193-208 (2000)
- [c6]Jean-Yves Marion, Jean-Yves Moyen: Efficient First Order Functional Program Interpreter with Time Bound Certifications. LPAR 2000: 25-42
- [i1]
1990 – 1999
- 1999
- [j2]Jean-Yves Marion: From Multiple Sequent for Additive Linear Logic to Decision Procedures for Free Lattices. Theor. Comput. Sci. 224(1-2): 157-172 (1999)
- 1998
- [c5]Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet: Complexity Classes and Rewrite Systems with Polynomial Interpretation. CSL 1998: 372-384
- 1997
- [c4]
- [c3]Daniel Leivant, Jean-Yves Marion: Predicative Functional Recurrence and Poly-space. TAPSOFT 1997: 369-380
- 1994
- [c2]Daniel Leivant, Jean-Yves Marion: Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. CSL 1994: 486-500
- 1993
- [j1]Daniel Leivant, Jean-Yves Marion: Lambda Calculus Characterizations of Poly-Time. Fundam. Inform. 19(1/2): 167-184 (1993)
- [c1]Daniel Leivant, Jean-Yves Marion: Lambda calculus characterizations of poly-time. TLCA 1993: 274-288
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:04 CEST by the dblp team