Jean-Yves Marion

Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2023

2022

A tier-based typed programming language characterizing Feasible Functionals.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2022

Complete and tractable machine-independent characterizations of second-order polytime.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2022

2021

Binary level toolchain provenance identification with graph neural networks.

[BibT_eX]

[DOI]

Tristan Benoit

Proceedings of the 28th IEEE International Conference on Software Analysis, 2021

Obfuscation-Resilient Executable Payload Extraction From Packed Malware.

[BibT_eX]

[DOI]

Proceedings of the 30th USENIX Security Symposium, 2021

2020

Primitive recursion in the abstract.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2020

Theoretical Computer Science: Computational Complexity.

[BibT_eX]

[DOI]

Proceedings of the A Guided Tour of Artificial Intelligence Research: Volume III: Interfaces and Applications of Artificial Intelligence, 2020

Theoretical Computer Science: Computability, Decidability and Logic.

[BibT_eX]

[DOI]

Proceedings of the A Guided Tour of Artificial Intelligence Research: Volume III: Interfaces and Applications of Artificial Intelligence, 2020

2019

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

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Computer Security Applications Conference, 2019

2018

Implicit complexity via structure transformation.

[BibT_eX]

[DOI]

CoRR, 2018

Towards Paving the Way for Large-Scale Windows Malware Analysis: Generic Binary Unpacking with Orders-of-Magnitude Performance Boost.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017

Backward-Bounded DSE: Targeting Infeasibility Questions on Obfuscated Codes.

[BibT_eX]

[DOI]

Robin David

Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

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

[BibT_eX]

[DOI]

Hubert Godfroy

Proceedings of the 12th International Conference on Malicious and Unwanted Software, 2017

2016

Two function algebras defining functions in NCk boolean circuits.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Gorille: Efficient and Relevant Software Comparisons.

[BibT_eX]

[DOI]

Philippe Antoine

ERCIM News, 2016

Targeting Infeasibility Questions on Obfuscated Codes.

[BibT_eX]

[DOI]

Robin David

CoRR, 2016

BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-Level Analysis.

[BibT_eX]

[DOI]

Proceedings of the IEEE 23rd International Conference on Software Analysis, 2016

Specification of concretization and symbolization policies in symbolic execution.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

Akira Mori

Mizuhito Ogawa

NII Shonan Meet. Rep., 2015

Developments in implicit computational complexity.

[BibT_eX]

[DOI]

Inf. Comput., 2015

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

[BibT_eX]

[DOI]

Fabrice Sabatier

Proceedings of the 10th International Conference on Malicious and Unwanted Software, 2015

Sound and Quasi-Complete Detection of Infeasible Test Requirements.

[BibT_eX]

[DOI]

Proceedings of the 8th IEEE International Conference on Software Testing, 2015

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

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

2014

Complexity Information Flow in a Multi-threaded Imperative Language.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2014

Malware Message Classification by Dynamic Analysis.

[BibT_eX]

[DOI]

Thanh Dinh Ta

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).

[BibT_eX]

[DOI]

Akitoshi Kawamura

David Nowak

NII Shonan Meet. Rep., 2013

Analysis and diversion of Duqu's driver.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Malicious and Unwanted Software: "The Americas", 2013

Evolving Graph-Structures and Their Implicit Computational Complexity.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Type-Based Complexity Analysis for Fork Processes.

[BibT_eX]

[DOI]

Emmanuel Hainry

Proceedings of the Foundations of Software Science and Computation Structures, 2013

2012

An Implicit Characterization of PSPACE.

[BibT_eX]

[DOI]

Marco Gaboardi

ACM Trans. Comput. Log., 2012

Theoretical Aspects of Computer Science.

[BibT_eX]

[DOI]

Thomas Schwentick

Theory Comput. Syst., 2012

Viruses in Turing's Garden.

[BibT_eX]

[DOI]

ERCIM News, 2012

Code synchronization by morphological analysis.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Malicious and Unwanted Software, 2012

Abstraction-Based Malware Analysis Using Rewriting and Model Checking.

[BibT_eX]

[DOI]

Philippe Beaucamps

Isabelle Gnaedig

Proceedings of the Computer Security - ESORICS 2012, 2012

Aligot: cryptographic function identification in obfuscated binary programs.

[BibT_eX]

[DOI]

Joan Calvet

José M. Fernandez

Proceedings of the ACM Conference on Computer and Communications Security, 2012

2011

Quasi-interpretations a way to control resources.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

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

[BibT_eX]

[DOI]

Susanne Albers

Theory Comput. Syst., 2011

A Type System for Complexity Flow Analysis.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010

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

[BibT_eX]

[DOI]

Proceedings of the 3rd Workshop on Cyber Security Experimentation and Test, 2010

Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science.

[BibT_eX]

[DOI]

Thomas Schwentick

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

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

[BibT_eX]

[DOI]

Thomas Schwentick

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

Behavior Abstraction in Malware Analysis.

[BibT_eX]

[DOI]

Philippe Beaucamps

Isabelle Gnaedig

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.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual Computer Security Applications Conference, 2010

2009

Architecture of a morphological malware detector.

[BibT_eX]

[DOI]

J. Comput. Virol., 2009

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

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2009

Guest editorial: Special issue on implicit computational complexity.

[BibT_eX]

[DOI]

Patrick Baillot

ACM Trans. Comput. Log., 2009

On tiered small jump operators

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2009

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

[BibT_eX]

[DOI]

Susanne Albers

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

A Computability Perspective on Self-Modifying Programs.

[BibT_eX]

[DOI]

Daniel Reynaud-Plantey

Proceedings of the Seventh IEEE International Conference on Software Engineering and Formal Methods, 2009

Server-side dynamic code analysis.

[BibT_eX]

[DOI]

Wadie Guizani

Daniel Reynaud-Plantey

Proceedings of the 4th International Conference on Malicious and Unwanted Software, 2009

2008

Learning discrete categorial grammars from structures.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2008

A Characterization of NCk.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2008

Characterizations of polynomial complexity classes with a better intensionality.

[BibT_eX]

[DOI]

Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2008

A logical account of pspace.

[BibT_eX]

[DOI]

Marco Gaboardi

Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2008

Morphological detection of malware.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Conference on Malicious and Unwanted Software, 2008

Analyzing the Implicit Computational Complexity of object-oriented programs.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Recursion Schemata for NCk.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007

On the defence notion.

[BibT_eX]

[DOI]

Anne Bonfante

J. Comput. Virol., 2007

Foreword.

[BibT_eX]

[DOI]

J. Comput. Virol., 2007

Learning tree languages from positive examples and membership queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Soft Linear Logic and Polynomial Complexity Classes.

[BibT_eX]

[DOI]

Marco Gaboardi

Proceedings of the Second Workshop on Logical and Semantic Frameworks, with Applications, 2007

Resource control of object-oriented programs

[BibT_eX]

[DOI]

CoRR, 2007

Predicative Analysis of Feasibility and Diagonalization.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 8th International Conference, 2007

Quasi-interpretation Synthesis by Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing, 2007

A Classification of Viruses Through Recursion Theorems.

[BibT_eX]

[DOI]

Proceedings of the Computation and Logic in the Real World, 2007

2006

On Abstract Computer Virology from a Recursion Theoretic Perspective.

[BibT_eX]

[DOI]

J. Comput. Virol., 2006

Implicit complexity over an arbitrary structure: Quantifier alternations.

[BibT_eX]

[DOI]

Inf. Comput., 2006

Quasi-friendly sup-interpretations

[BibT_eX]

[DOI]

CoRR, 2006

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

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2006

Resource Analysis by Sup-interpretation.

[BibT_eX]

[DOI]

Proceedings of the Functional and Logic Programming, 8th International Symposium, 2006

Towards an Implicit Characterization of NCk.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Computers under Attacks!

[BibT_eX]

[DOI]

Anne Bonfante

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.

[BibT_eX]

[DOI]

J. Log. Comput., 2005

Quasi-interpretations and Small Space Bounds.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

Toward an Abstract Computer Virology.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing, 2005

2004

Editorial: Implicit Computational Complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Learning reversible categorial grammars from structures.

[BibT_eX]

Proceedings of the Intelligent Information Processing and Web Mining, 2004

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

[BibT_eX]

[DOI]

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003

Analysing the implicit complexity of programs.

[BibT_eX]

[DOI]

Inf. Comput., 2003

Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Workshop on Implicit Computational Complexity, 2003

Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2003

2002

Kolmogorov complexity and non-determinism.

[BibT_eX]

[DOI]

Serge Grigorieff

Theor. Comput. Sci., 2002

Learning languages from positive examples with dependencies.

[BibT_eX]

[DOI]

Proceedings of the Sixth International Workshop on Tree Adjoining Grammar and Related Frameworks, 2002

2001

Algorithms with polynomial interpretation termination proof.

[BibT_eX]

[DOI]

J. Funct. Program., 2001

On Lexicographic Termination Ordering with Space Bound Certifications.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of System Informatics, 2001

Actual Arithmetic and Feasibility.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 15th International Workshop, 2001

2000

A characterization of alternating log time by ramified recurrence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

The Light Lexicographic path Ordering

[BibT_eX]

[DOI]

E. A. Cichon

CoRR, 2000

Efficient First Order Functional Program Interpreter with Time Bound Certifications.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming and Automated Reasoning, 2000

1999

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

1998

Complexity Classes and Rewrite Systems with Polynomial Interpretation.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 12th International Workshop, 1998

1997

Predicative Functional Recurrence and Poly-space.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Case Study: Additive Linear Logic and Lattices.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

1994

Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 8th International Workshop, 1994

1993

Lambda Calculus Characterizations of Poly-Time.

[BibT_eX]