Guillaume Bonfante

Anuyan Ithayakumar

Proceedings of the Foundations and Practice of Security - 15th International Symposium, 2022

2021

The decidability of the genus of regular languages and directed emulators.

[BibT_eX]

[DOI]

CoRR, 2021

At the Bottom of Binary Analysis: Instructions.

[BibT_eX]

[DOI]

Alexandre Talon

Proceedings of the Foundations and Practice of Security - 14th International Symposium, 2021

2020

Termination of graph rewriting systems through language theory.

[BibT_eX]

[DOI]

Miguel Couceiro

Proceedings of the First International Conference "Algebras, graphs and ordered sets", 2020

2019

Decidability of regular language genus computation.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2019

2018

Non-size increasing graph rewriting for natural language processing.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2018

The genus of regular languages.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2018

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

Function Classification for the Retro-Engineering of Malwares.

[BibT_eX]

[DOI]

Julien Oury Nogues

Proceedings of the Foundations and Practice of Security - 9th International Symposium, 2016

2015

Developments in Implicit Complexity (DICE 2012).

[BibT_eX]

[DOI]

Ugo Dal Lago

Theor. Comput. Sci., 2015

Real or natural number interpretation and their effect on complexity.

[BibT_eX]

[DOI]

Antoine Henrot

Theor. Comput. Sci., 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

Immune Systems in Computer Virology.

[BibT_eX]

[DOI]

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 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

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

Non-simplifying Graph Rewriting Termination

[BibT_eX]

[DOI]

Proceedings of the Proceedings 7th International Workshop on Computing with Terms and Graphs, 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

2012

Grew : un outil de réécriture de graphes pour le TAL (Grew: a Graph Rewriting Tool for NLP) [in French].

[BibT_eX]

[DOI]

Proceedings of the Joint Conference JEP-TALN-RECITAL 2012, 2012

Code synchronization by morphological analysis.

[BibT_eX]

[DOI]

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

2011

Quasi-interpretations a way to control resources.

[BibT_eX]

[DOI]

Jean-Yves Moyen

Theor. Comput. Sci., 2011

Enrichissement de structures en dépendances par réécriture de graphes (Dependency structure enrichment using graph rewriting).

[BibT_eX]

[DOI]

Proceedings of the Actes de la 18e conférence sur le Traitement Automatique des Langues Naturelles. Articles longs, 2011

Course of value distinguishes the intentionality of programming languages.

[BibT_eX]

[DOI]

Proceedings of the 2011 Symposium on Information and Communication Technology, 2011

Modular Graph Rewriting to Compute Semantics.

[BibT_eX]

[DOI]

Proceedings of the Ninth International Conference on Computational Semantics, 2011

Complexité implicite des calculs : interprétation de programmes. (Implicit computational complexity : program interpretations).

[BibT_eX]

[DOI]

, 2011

2010

Observation of implicit complexity by non confluence

[BibT_eX]

[DOI]

Proceedings of the Proceedings International Workshop on Developments in Implicit Computational complExity, 2010

Complexity Invariance of Real Interpretations.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Réécriture de graphes de dépendances pour l'interface syntaxe-sémantique.

[BibT_eX]

[DOI]

Proceedings of the Actes de la 17e conférence sur le Traitement Automatique des Langues Naturelles. Articles longs, 2010

Characterising Space Complexity Classes via Knuth-Bendix Orders.

[BibT_eX]

[DOI]

Georg Moser

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2009

Architecture of a morphological malware detector.

[BibT_eX]

[DOI]

J. Comput. Virol., 2009

Programs as polygraphs: computability and complexity

[BibT_eX]

[DOI]

Yves Guiraud

, 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

Dependency Constraints for Lexical Disambiguation.

[BibT_eX]

[DOI]

Mathieu Morey

Proceedings of the 11th International Workshop on Parsing Technologies (IWPT-2009), 2009

2008

Morphological detection of malware.

[BibT_eX]

[DOI]

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

Recursion Schemata for NCk.

[BibT_eX]

[DOI]

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

2007

Foreword.

[BibT_eX]

[DOI]

J. Comput. Virol., 2007

Intensional Properties of Polygraphs.

[BibT_eX]

[DOI]

Yves Guiraud

Proceedings of the Fourth International Workshop on Computing with Terms and Graphs, 2007

Quasi-interpretation Synthesis by Decomposition.

[BibT_eX]

[DOI]

Romain Péchoux

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

Lexical Disambiguation with Polarities and Automata.

[BibT_eX]

[DOI]

Joseph Le Roux

Guy Perrier

Proceedings of the Implementation and Application of Automata, 2006

A Characterization of Alternating Log Time by First Order Functional Programs.

[BibT_eX]

[DOI]

Romain Péchoux

Proceedings of the Logic for Programming, 2006

Towards an Implicit Characterization of NCk.

[BibT_eX]

[DOI]

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

Some Programming Languages for Logspace and Ptime.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 2006

2005

Quasi-interpretations and Small Space Bounds.

[BibT_eX]

[DOI]

Jean-Yves Moyen

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

Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation.

[BibT_eX]

[DOI]

Guy Perrier

Proceedings of the COLING 2004, 2004

2001

Algorithms with polynomial interpretation termination proof.

[BibT_eX]

[DOI]

J. Funct. Program., 2001

Stochastic Lambek Categorial Grammars.

[BibT_eX]

[DOI]

Philippe de Groote

Proceedings of the joint meeting of the 6th Conference on Formal Grammar (FG) and the 7th Conference on Mathematics of Language (MOL), 2001

On Lexicographic Termination Ordering with Space Bound Certifications.

[BibT_eX]

[DOI]

Jean-Yves Moyen

Proceedings of the Perspectives of System Informatics, 2001

2000

Constructions d'ordres, analyse de la complexité.

[BibT_eX]

[DOI]