Jean-Yves Marion

According to our database1, Jean-Yves Marion
  • authored at least 92 papers between 1993 and 2018.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Implicit complexity via structure transformation.
CoRR, 2018

2017
Backward-Bounded DSE: Targeting Infeasibility Questions on Obfuscated Codes.
Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

A construction of a self-modifiying language with a formal correction proof.
Proceedings of the 12th International Conference on Malicious and Unwanted Software, 2017

2016
Two function algebras defining functions in NCk boolean circuits.
Inf. Comput., 2016

Gorille: Efficient and Relevant Software Comparisons.
ERCIM News, 2016

Targeting Infeasibility Questions on Obfuscated Codes.
CoRR, 2016

BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level Analysis.
Proceedings of the IEEE 23rd International Conference on Software Analysis, 2016

Specification of concretization and symbolization policies in symbolic execution.
Proceedings of the 25th International Symposium on Software Testing and Analysis, 2016

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

Developments in implicit computational complexity.
Inf. Comput., 2015

Gorille sniffs code similarities, the case study of qwerty versus regin.
Proceedings of the 10th International Conference on Malicious and Unwanted Software, 2015

Sound and Quasi-Complete Detection of Infeasible Test Requirements.
Proceedings of the 8th IEEE International Conference on Software Testing, 2015

CoDisasm: Medium Scale Concatic Disassembly of Self-Modifying Binaries with Overlapping Instructions.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014
Analysis and Diversion of Duqu's Driver.
CoRR, 2014

Complexity Information Flow in a Multi-threaded Imperative Language.
Proceedings of the Theory and Applications of Models of Computation, 2014

Malware Message Classification by Dynamic Analysis.
Proceedings of the Foundations and Practice of Security - 7th International Symposium, 2014

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

Analysis and diversion of Duqu's driver.
Proceedings of the 8th International Conference on Malicious and Unwanted Software: "The Americas", 2013

Evolving Graph-Structures and Their Implicit Computational Complexity.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Type-Based Complexity Analysis for Fork Processes.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

2012
An Implicit Characterization of PSPACE.
ACM Trans. Comput. Log., 2012

Theoretical Aspects of Computer Science.
Theory Comput. Syst., 2012

Viruses in Turing's Garden.
ERCIM News, 2012

Complexity Information Flow in a Multi-threaded Imperative Language
CoRR, 2012

Code synchronization by morphological analysis.
Proceedings of the 7th International Conference on Malicious and Unwanted Software, 2012

Abstraction-Based Malware Analysis Using Rewriting and Model Checking.
Proceedings of the Computer Security - ESORICS 2012, 2012

Aligot: cryptographic function identification in obfuscated binary programs.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

2011
Quasi-interpretations a way to control resources.
Theor. Comput. Sci., 2011

Preface: Special Issue on Theoretical Aspects of Computer Science (STACS).
Theory Comput. Syst., 2011

A Type System for Complexity Flow Analysis.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010
An Implicit Characterization of PSPACE
CoRR, 2010

Isolated Virtualised Clusters: Testbeds for High-Risk Security Experimentation and Training.
Proceedings of the 3rd Workshop on Cyber Security Experimentation and Test, 2010

Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Behavior Abstraction in Malware Analysis.
Proceedings of the Runtime Verification - First International Conference, 2010

The case for in-the-lab botnet experimentation: creating and taking down a 3000-node botnet.
Proceedings of the Twenty-Sixth Annual Computer Security Applications Conference, 2010

2009
Architecture of a morphological malware detector.
Journal in Computer Virology, 2009

Sup-interpretations, a semantic method for static analysis of program resources.
ACM Trans. Comput. Log., 2009

Guest editorial: Special issue on implicit computational complexity.
ACM Trans. Comput. Log., 2009

On tiered small jump operators
Logical Methods in Computer Science, 2009

Preface - 26th International Symposium on Theoretical Aspects of Computer Science.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

A Computability Perspective on Self-Modifying Programs.
Proceedings of the Seventh IEEE International Conference on Software Engineering and Formal Methods, 2009

Server-side dynamic code analysis.
Proceedings of the 4th International Conference on Malicious and Unwanted Software, 2009

2008
Learning discrete categorial grammars from structures.
ITA, 2008

Soft Linear Logic and Polynomial Complexity Classes.
Electr. Notes Theor. Comput. Sci., 2008

A Characterization of NCk.
Proceedings of the Theory and Applications of Models of Computation, 2008

Characterizations of polynomial complexity classes with a better intensionality.
Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2008

A logical account of pspace.
Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2008

Morphological detection of malware.
Proceedings of the 3rd International Conference on Malicious and Unwanted Software, 2008

Analyzing the Implicit Computational Complexity of object-oriented programs.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Recursion Schemata for NCk.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007
On the defence notion.
Journal in Computer Virology, 2007

Foreword.
Journal in Computer Virology, 2007

Learning tree languages from positive examples and membership queries.
Theor. Comput. Sci., 2007

On the defence notion
CoRR, 2007

Resource control of object-oriented programs
CoRR, 2007

Predicative Analysis of Feasibility and Diagonalization.
Proceedings of the Typed Lambda Calculi and Applications, 8th International Conference, 2007

Quasi-interpretation Synthesis by Decomposition.
Proceedings of the Theoretical Aspects of Computing, 2007

A Classification of Viruses Through Recursion Theorems.
Proceedings of the Computation and Logic in the Real World, 2007

2006
On Abstract Computer Virology from a Recursion Theoretic Perspective.
Journal in Computer Virology, 2006

Implicit complexity over an arbitrary structure: Quantifier alternations.
Inf. Comput., 2006

Quasi-friendly sup-interpretations
CoRR, 2006

Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2006

A Characterization of Alternating Log Time by First Order Functional Programs.
Proceedings of the Logic for Programming, 2006

Resource Analysis by Sup-interpretation.
Proceedings of the Functional and Logic Programming, 8th International Symposium, 2006

Towards an Implicit Characterization of NCk.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Computers under Attacks!
Proceedings of the CAISE*06 Workshop on Philosophical Foundations on Information Systems Engineering PhiSE '06, 2006

2005
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time.
J. Log. Comput., 2005

Quasi-interpretations and Small Space Bounds.
Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

Toward an Abstract Computer Virology.
Proceedings of the Theoretical Aspects of Computing, 2005

2004
Editorial: Implicit Computational Complexity.
Theor. Comput. Sci., 2004

Learning reversible categorial grammars from structures.
Proceedings of the Intelligent Information Processing and Web Mining, 2004

Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Learning Tree Languages from Positive Examples and Membership Queries.
Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003
Analysing the implicit complexity of programs.
Inf. Comput., 2003

Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH.
Electr. Notes Theor. Comput. Sci., 2003

Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time.
Proceedings of the Foundations of Software Science and Computational Structures, 2003

2002
Kolmogorov complexity and non-determinism.
Theor. Comput. Sci., 2002

Learning languages from positive examples with dependencies.
Proceedings of the Sixth International Workshop on Tree Adjoining Grammar and Related Frameworks, 2002

2001
Algorithms with polynomial interpretation termination proof.
J. Funct. Program., 2001

On Lexicographic Termination Ordering with Space Bound Certifications.
Proceedings of the Perspectives of System Informatics, 2001

Actual Arithmetic and Feasibility.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000
A characterization of alternating log time by ramified recurrence.
Theor. Comput. Sci., 2000

The Light Lexicographic path Ordering
CoRR, 2000

Efficient First Order Functional Program Interpreter with Time Bound Certifications.
Proceedings of the Logic for Programming and Automated Reasoning, 2000

1999
From Multiple Sequent for Additive Linear Logic to Decision Procedures for Free Lattices.
Theor. Comput. Sci., 1999

1998
Complexity Classes and Rewrite Systems with Polynomial Interpretation.
Proceedings of the Computer Science Logic, 12th International Workshop, 1998

1997
Predicative Functional Recurrence and Poly-space.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Case Study: Additive Linear Logic and Lattices.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

1994
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space.
Proceedings of the Computer Science Logic, 8th International Workshop, 1994

1993
Lambda Calculus Characterizations of Poly-Time.
Fundam. Inform., 1993

Lambda calculus characterizations of poly-time.
Proceedings of the Typed Lambda Calculi and Applications, 1993


  Loading...