Guillaume Bonfante

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 18

Top Venues

FPS

CoRR

Math. Struct. Comput. Sci.

Theor. Comput. Sci.

National Polytechnic Institute of Lorraine, Nancy, France (PHD)

Education History

National Polytechnic Institute of Lorraine, Nancy, France

PHD

Publications

Guillaume Bonfante, Florian L. Deloup
The genus of regular languages and directed graph emulators. Theor. Comput. Sci. 1000 (2024)
Guillaume Bonfante, Anuyan Ithayakumar
Where is the Virtual Machine Within Cpython? FPS (2022)
Guillaume Bonfante, Alexandre Talon
At the Bottom of Binary Analysis: Instructions. FPS (2021)
Guillaume Bonfante, Florian L. Deloup
The decidability of the genus of regular languages and directed emulators. CoRR (2021)
Guillaume Bonfante, Miguel Couceiro
Termination of graph rewriting systems through language theory. ALGOS (2020)
Guillaume Bonfante, Florian L. Deloup
Decidability of regular language genus computation. Math. Struct. Comput. Sci. 29 (9) (2019)
Guillaume Bonfante, Florian L. Deloup
The genus of regular languages. Math. Struct. Comput. Sci. 28 (1) (2018)
Guillaume Bonfante, Bruno Guillaume
Non-size increasing graph rewriting for natural language processing. Math. Struct. Comput. Sci. 28 (8) (2018)
Guillaume Bonfante, Hubert Godfroy, Jean-Yves Marion
A construction of a self-modifiying language with a formal correction proof. MALWARE (2017)
Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem
boolean circuits. Inf. Comput. 248 (2016)
Philippe Antoine, Guillaume Bonfante, Jean-Yves Marion
Gorille: Efficient and Relevant Software Comparisons. ERCIM News 2016 (106) (2016)
Guillaume Bonfante, Julien Oury Nogues
Function Classification for the Retro-Engineering of Malwares. FPS (2016)
Guillaume Bonfante, José M. Fernandez, Jean-Yves Marion, Benjamin Rouxel, Fabrice Sabatier, Aurélien Thierry
CoDisasm: Medium Scale Concatic Disassembly of Self-Modifying Binaries with Overlapping Instructions. CCS (2015)
Guillaume Bonfante, Florian L. Deloup, Antoine Henrot
Real or natural number interpretation and their effect on complexity. Theor. Comput. Sci. 585 (2015)
Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier
Gorille sniffs code similarities, the case study of qwerty versus regin. MALWARE (2015)
Guillaume Bonfante, Florian L. Deloup
Decidability of regular language genus computation. CoRR (2015)
Guillaume Bonfante, Mohamed El-Aqqad, Benjamin Greenbaum, Mathieu Hoyrup
Immune Systems in Computer Virology. CiE (2015)
Ugo Dal Lago, Guillaume Bonfante
Developments in Implicit Complexity (DICE 2012). Theor. Comput. Sci. 585 (2015)
Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurélien Thierry
Analysis and Diversion of Duqu's Driver. CoRR (2014)
Guillaume Bonfante, Jean-Yves Marion, Thanh Dinh Ta
Malware Message Classification by Dynamic Analysis. FPS (2014)
Guillaume Bonfante, Bruno Guillaume
Non-simplifying Graph Rewriting Termination TERMGRAPH (2013)
Guillaume Bonfante, Florian L. Deloup
The genus of regular languages CoRR (2013)
Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurélien Thierry
Analysis and diversion of Duqu's driver. MALWARE (2013)
Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurélien Thierry
Code synchronization by morphological analysis. MALWARE (2012)
Bruno Guillaume, Guillaume Bonfante, Paul Masson, Mathieu Morey, Guy Perrier
Grew : un outil de réécriture de graphes pour le TAL (Grew: a Graph Rewriting Tool for NLP) [in French]. JEP-TALN-RECITAL (2012)
Guillaume Bonfante, Bruno Guillaume, Mathieu Morey, Guy Perrier
Modular Graph Rewriting to Compute Semantics. IWCS (2011)
Guillaume Bonfante, Bruno Guillaume, Mathieu Morey, Guy Perrier
Enrichissement de structures en dépendances par réécriture de graphes (Dependency structure enrichment using graph rewriting). TALN (Articles longs) (2011)
Guillaume Bonfante
Course of value distinguishes the intentionality of programming languages. SoICT (2011)
Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen
Quasi-interpretations a way to control resources. Theor. Comput. Sci. 412 (25) (2011)
Guillaume Bonfante
Observation of implicit complexity by non confluence DICE (2010)
Guillaume Bonfante, Georg Moser
Characterising Space Complexity Classes via Knuth-Bendix Orders. LPAR (Yogyakarta) (2010)
Guillaume Bonfante, Bruno Guillaume, Mathieu Morey, Guy Perrier
Réécriture de graphes de dépendances pour l'interface syntaxe-sémantique. TALN (Articles longs) (2010)
Guillaume Bonfante, Florian L. Deloup
Complexity Invariance of Real Interpretations. TAMC (2010)
Guillaume Bonfante, Yves Guiraud
Programs as polygraphs: computability and complexity Logical Methods in Computer Science 5 (2) (2009)
Guillaume Bonfante, Jean-Yves Marion, Daniel Reynaud-Plantey
A Computability Perspective on Self-Modifying Programs. SEFM (2009)
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
Architecture of a morphological malware detector. J. Comput. Virol. 5 (3) (2009)
Guillaume Bonfante, Bruno Guillaume, Mathieu Morey
Dependency Constraints for Lexical Disambiguation. IWPT (2009)
Guillaume Bonfante, Yves Guiraud
Intensional Properties of Polygraphs. Electron. Notes Theor. Comput. Sci. 203 (1) (2008)
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
Morphological detection of malware. MALWARE (2008)
Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem
Recursion Schemata for NCk. CSL (2008)
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
A Classification of Viruses Through Recursion Theorems. CiE (2007)
Guillaume Bonfante, Jean-Yves Marion
Foreword. J. Comput. Virol. 3 (1) (2007)
Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux
Quasi-interpretation Synthesis by Decomposition. ICTAC (2007)
Guillaume Bonfante, Yves Guiraud
Intensional properties of polygraphs CoRR (2007)
Guillaume Bonfante, Joseph Le Roux, Guy Perrier
Lexical Disambiguation with Polarities and Automata. CIAA (2006)
Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem
. CSL (2006)
Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux
A Characterization of Alternating Log Time by First Order Functional Programs. LPAR (2006)
Guillaume Bonfante
Some Programming Languages for Logspace and Ptime. AMAST (2006)
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
On Abstract Computer Virology from a Recursion Theoretic Perspective. J. Comput. Virol. 1 (3-4) (2006)
Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen
Quasi-interpretations and Small Space Bounds. RTA (2005)
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
Toward an Abstract Computer Virology. ICTAC (2005)
Guillaume Bonfante, Bruno Guillaume, Guy Perrier
Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation. COLING (2004)
Guillaume Bonfante, Philippe de Groote
Stochastic Lambek Categorial Grammars. Electron. Notes Theor. Comput. Sci. 53 (2001)
Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet
Algorithms with polynomial interpretation termination proof. J. Funct. Program. 11 (1) (2001)
Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen
On Lexicographic Termination Ordering with Space Bound Certifications. Ershov Memorial Conference (2001)
Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet
Complexity Classes and Rewrite Systems with Polynomial Interpretation. CSL (1998)

Guillaume Bonfante.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Guillaume Bonfante