Complexity Classes and Rewrite Systems with Polynomial Interpretation. - Guillaume Bonfante; Adam Cichon; Jean-Yves Marion; Hélène Touzet (CSL, 1998)

Constructions d'ordres, analyse de la complexité. - Guillaume Bonfante (2000)

On Lexicographic Termination Ordering with Space Bound Certifications. - Guillaume Bonfante; Jean-Yves Marion; Jean-Yves Moyen (Ershov Memorial Conference, 2001)

Stochastic Lambek Categorial Grammars. - Guillaume Bonfante; Philippe de Groote (FGMOL, 2001)

Algorithms with polynomial interpretation termination proof. - Guillaume Bonfante; Adam Cichon; Jean-Yves Marion; Hélène Touzet (J. Funct. Program., 2001)

Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation. - Guillaume Bonfante; Bruno Guillaume; Guy Perrier (COLING, 2004)

Toward an Abstract Computer Virology. - Guillaume Bonfante; Matthieu Kaczmarek; Jean-Yves Marion (ICTAC, 2005)

Quasi-interpretations and Small Space Bounds. - Guillaume Bonfante; Jean-Yves Marion; Jean-Yves Moyen (RTA, 2005)

Some Programming Languages for Logspace and Ptime. - Guillaume Bonfante (AMAST, 2006)

Towards an Implicit Characterization of NCk. - Guillaume Bonfante; Reinhard Kahle; Jean-Yves Marion; Isabel Oitavem (CSL, 2006)

A Characterization of Alternating Log Time by First Order Functional Programs. - Guillaume Bonfante; Jean-Yves Marion; Romain Péchoux (LPAR, 2006)

Lexical Disambiguation with Polarities and Automata. - Guillaume Bonfante; Joseph Le Roux; Guy Perrier (CIAA, 2006)

On Abstract Computer Virology from a Recursion Theoretic Perspective. - Guillaume Bonfante; Matthieu Kaczmarek; Jean-Yves Marion (J. Comput. Virol., 2006)

A Classification of Viruses Through Recursion Theorems. - Guillaume Bonfante; Matthieu Kaczmarek; Jean-Yves Marion (CiE, 2007)

Quasi-interpretation Synthesis by Decomposition. - Guillaume Bonfante; Jean-Yves Marion; Romain Péchoux (ICTAC, 2007)

Intensional Properties of Polygraphs. - Guillaume Bonfante; Yves Guiraud (TERMGRAPH@ETAPS, 2007)

Foreword. - Guillaume Bonfante; Jean-Yves Marion (J. Comput. Virol., 2007)

Recursion Schemata for NCk. - Guillaume Bonfante; Reinhard Kahle; Jean-Yves Marion; Isabel Oitavem (CSL, 2008)

Morphological detection of malware. - Guillaume Bonfante; Matthieu Kaczmarek; Jean-Yves Marion (MALWARE, 2008)

Dependency Constraints for Lexical Disambiguation. - Guillaume Bonfante; Bruno Guillaume; Mathieu Morey (IWPT, 2009)

A Computability Perspective on Self-Modifying Programs. - Guillaume Bonfante; Jean-Yves Marion; Daniel Reynaud-Plantey (SEFM, 2009)

Programs as polygraphs: computability and complexity - Guillaume Bonfante; Yves Guiraud (Logical Methods in Computer Science, 2009)

Architecture of a morphological malware detector. - Guillaume Bonfante; Matthieu Kaczmarek; Jean-Yves Marion (J. Comput. Virol., 2009)

Characterising Space Complexity Classes via Knuth-Bendix Orders. - Guillaume Bonfante; Georg Moser (LPAR (Yogyakarta), 2010)

Réécriture de graphes de dépendances pour l'interface syntaxe-sémantique. - Guillaume Bonfante; Bruno Guillaume; Mathieu Morey; Guy Perrier (TALN (Articles longs), 2010)

Complexity Invariance of Real Interpretations. - Guillaume Bonfante; Florian L. Deloup (TAMC, 2010)

Observation of implicit complexity by non confluence - Guillaume Bonfante (DICE, 2010)

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

Modular Graph Rewriting to Compute Semantics. - Guillaume Bonfante; Bruno Guillaume; Mathieu Morey; Guy Perrier (IWCS, 2011)

Course of value distinguishes the intentionality of programming languages. - Guillaume Bonfante (SoICT, 2011)

Enrichissement de structures en dépendances par réécriture de graphes (Dependency structure enrichment using graph rewriting). - Guillaume Bonfante; Bruno Guillaume; Mathieu Morey; Guy Perrier (TALN (Articles longs), 2011)

Quasi-interpretations a way to control resources. - Guillaume Bonfante; Jean-Yves Marion; Jean-Yves Moyen (Theor. Comput. Sci., 2011)

Code synchronization by morphological analysis. - Guillaume Bonfante; Jean-Yves Marion; Fabrice Sabatier; Aurélien Thierry (MALWARE, 2012)

Grew : un outil de réécriture de graphes pour le TAL (Grew: a Graph Rewriting Tool for NLP) [in French]. - Bruno Guillaume; Guillaume Bonfante; Paul Masson; Mathieu Morey; Guy Perrier (JEP-TALN-RECITAL, 2012)

Analysis and diversion of Duqu's driver. - Guillaume Bonfante; Jean-Yves Marion; Fabrice Sabatier; Aurélien Thierry (MALWARE, 2013)

Non-simplifying Graph Rewriting Termination - Guillaume Bonfante; Bruno Guillaume (TERMGRAPH, 2013)

Malware Message Classification by Dynamic Analysis. - Guillaume Bonfante; Jean-Yves Marion; Thanh Dinh Ta (FPS, 2014)

CoDisasm: Medium Scale Concatic Disassembly of Self-Modifying Binaries with Overlapping Instructions. - Guillaume Bonfante; José M. Fernandez 001; Jean-Yves Marion; Benjamin Rouxel; Fabrice Sabatier; Aurélien Thierry (CCS, 2015)

Immune Systems in Computer Virology. - Guillaume Bonfante; Mohamed El-Aqqad; Benjamin Greenbaum; Mathieu Hoyrup (CiE, 2015)

Gorille sniffs code similarities, the case study of qwerty versus regin. - Guillaume Bonfante; Jean-Yves Marion; Fabrice Sabatier (MALWARE, 2015)

Real or natural number interpretation and their effect on complexity. - Guillaume Bonfante; Florian L. Deloup; Antoine Henrot (Theor. Comput. Sci., 2015)

Developments in Implicit Complexity (DICE 2012). - Ugo Dal Lago; Guillaume Bonfante (Theor. Comput. Sci., 2015)

Function Classification for the Retro-Engineering of Malwares. - Guillaume Bonfante; Julien Oury Nogues (FPS, 2016)

Gorille: Efficient and Relevant Software Comparisons. - Philippe Antoine; Guillaume Bonfante; Jean-Yves Marion (ERCIM News, 2016)

Two function algebras defining functions in NCk boolean circuits. - Guillaume Bonfante; Reinhard Kahle; Jean-Yves Marion; Isabel Oitavem (Inf. Comput., 2016)

A construction of a self-modifiying language with a formal correction proof. - Guillaume Bonfante; Hubert Godfroy; Jean-Yves Marion (MALWARE, 2017)

The genus of regular languages. - Guillaume Bonfante; Florian L. Deloup (Math. Struct. Comput. Sci., 2018)

Non-size increasing graph rewriting for natural language processing. - Guillaume Bonfante; Bruno Guillaume (Math. Struct. Comput. Sci., 2018)

Decidability of regular language genus computation. - Guillaume Bonfante; Florian L. Deloup (Math. Struct. Comput. Sci., 2019)

Termination of graph rewriting systems through language theory. - Guillaume Bonfante; Miguel Couceiro (ALGOS, 2020)

At the Bottom of Binary Analysis: Instructions. - Guillaume Bonfante; Alexandre Talon (FPS, 2021)

The decidability of the genus of regular languages and directed emulators. - Guillaume Bonfante; Florian L. Deloup (CoRR, 2021)

Where is the Virtual Machine Within Cpython? - Guillaume Bonfante; Anuyan Ithayakumar (FPS, 2022)

Monitoring the Execution of Cryptographic Functions. - Matthieu Amet; Oussama Ben Moussa; Guillaume Bonfante; Sébastien Duval (FPS (1), 2024)

The genus of regular languages and directed graph emulators. - Guillaume Bonfante; Florian L. Deloup (Theor. Comput. Sci., 2024)