default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuillaume Bonfante
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Guillaume Bonfante, Florian L. Deloup:
The genus of regular languages and directed graph emulators. Theor. Comput. Sci. 1000: 114579 (2024)- 2022
- [c37]Guillaume Bonfante, Anuyan Ithayakumar:
Where is the Virtual Machine Within Cpython? FPS 2022: 175-191 - 2021
- [c36]Guillaume Bonfante, Alexandre Talon:
At the Bottom of Binary Analysis: Instructions. FPS 2021: 311-320 - [i6]Guillaume Bonfante, Florian L. Deloup:
The decidability of the genus of regular languages and directed emulators. CoRR abs/2109.05735 (2021) - 2020
- [c35]Guillaume Bonfante, Miguel Couceiro:
Termination of graph rewriting systems through language theory. ALGOS 2020: 87-99
2010 – 2019
- 2019
- [j12]Guillaume Bonfante, Florian L. Deloup:
Decidability of regular language genus computation. Math. Struct. Comput. Sci. 29(9): 1428-1443 (2019) - [e3]Nur Zincir-Heywood, Guillaume Bonfante, Mourad Debbabi, Joaquín García-Alfaro
:
Foundations and Practice of Security - 11th International Symposium, FPS 2018, Montreal, QC, Canada, November 13-15, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11358, Springer 2019, ISBN 978-3-030-18418-6 [contents] - 2018
- [j11]Guillaume Bonfante, Florian L. Deloup:
The genus of regular languages. Math. Struct. Comput. Sci. 28(1): 14-44 (2018) - [j10]Guillaume Bonfante, Bruno Guillaume:
Non-size increasing graph rewriting for natural language processing. Math. Struct. Comput. Sci. 28(8): 1451-1484 (2018) - 2017
- [c34]Guillaume Bonfante, Hubert Godfroy, Jean-Yves Marion:
A construction of a self-modifiying language with a formal correction proof. MALWARE 2017: 99-106 - [e2]Guillaume Bonfante, Georg Moser:
Proceedings 8th Workshop on Developments in Implicit Computational Complexity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, DICE-FOPARA@ETAPS 2017, Uppsala, Sweden, April 22-23, 2017. EPTCS 248, 2017 [contents] - 2016
- [j9]Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem:
Two function algebras defining functions in NCk boolean circuits. Inf. Comput. 248: 82-103 (2016) - [c33]Guillaume Bonfante, Julien Oury Nogues:
Function Classification for the Retro-Engineering of Malwares. FPS 2016: 241-255 - [e1]Joaquín García-Alfaro, Evangelos Kranakis, Guillaume Bonfante:
Foundations and Practice of Security - 8th International Symposium, FPS 2015, Clermont-Ferrand, France, October 26-28, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9482, Springer 2016, ISBN 978-3-319-30302-4 [contents] - [i5]Philippe Antoine, Guillaume Bonfante, Jean-Yves Marion:
Gorille: Efficient and Relevant Software Comparisons. ERCIM News 2016(106) (2016) - 2015
- [j8]Ugo Dal Lago, Guillaume Bonfante:
Developments in Implicit Complexity (DICE 2012). Theor. Comput. Sci. 585: 1-2 (2015) - [j7]Guillaume Bonfante, Florian L. Deloup, Antoine Henrot:
Real or natural number interpretation and their effect on complexity. Theor. Comput. Sci. 585: 25-40 (2015) - [c32]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: 745-756 - [c31]Guillaume Bonfante, Mohamed El-Aqqad, Benjamin Greenbaum, Mathieu Hoyrup:
Immune Systems in Computer Virology. CiE 2015: 127-136 - [c30]Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier:
Gorille sniffs code similarities, the case study of qwerty versus regin. MALWARE 2015: 82-89 - [i4]Guillaume Bonfante, Florian L. Deloup:
Decidability of regular language genus computation. CoRR abs/1511.09405 (2015) - 2014
- [c29]Guillaume Bonfante, Jean-Yves Marion, Thanh Dinh Ta:
Malware Message Classification by Dynamic Analysis. FPS 2014: 112-128 - [i3]Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurélien Thierry:
Analysis and Diversion of Duqu's Driver. CoRR abs/1401.6120 (2014) - 2013
- [c28]Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurélien Thierry:
Analysis and diversion of Duqu's driver. MALWARE 2013: 109-115 - [c27]Guillaume Bonfante, Bruno Guillaume:
Non-simplifying Graph Rewriting Termination. TERMGRAPH 2013: 4-16 - [i2]Guillaume Bonfante, Florian L. Deloup:
The genus of regular languages. CoRR abs/1301.4981 (2013) - 2012
- [c26]Guillaume Bonfante, Jean-Yves Marion, Fabrice Sabatier, Aurélien Thierry:
Code synchronization by morphological analysis. MALWARE 2012: 112-119 - [c25]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: 1-2 - 2011
- [b2]Guillaume Bonfante:
Complexité implicite des calculs : interprétation de programmes. (Implicit computational complexity : program interpretations). National Polytechnic Institute of Lorraine, Nancy, France, 2011 - [j6]Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen:
Quasi-interpretations a way to control resources. Theor. Comput. Sci. 412(25): 2776-2796 (2011) - [c24]Guillaume Bonfante, Bruno Guillaume, Mathieu Morey, Guy Perrier:
Modular Graph Rewriting to Compute Semantics. IWCS 2011 - [c23]Guillaume Bonfante:
Course of value distinguishes the intentionality of programming languages. SoICT 2011: 189-198 - [c22]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: 317-328 - 2010
- [c21]Guillaume Bonfante, Georg Moser:
Characterising Space Complexity Classes via Knuth-Bendix Orders. LPAR (Yogyakarta) 2010: 142-156 - [c20]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: 331-340 - [c19]Guillaume Bonfante, Florian L. Deloup:
Complexity Invariance of Real Interpretations. TAMC 2010: 139-150 - [c18]Guillaume Bonfante:
Observation of implicit complexity by non confluence. DICE 2010: 15-29
2000 – 2009
- 2009
- [j5]Guillaume Bonfante, Yves Guiraud:
Programs as polygraphs: computability and complexity. 5(2) (2009) - [j4]Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion:
Architecture of a morphological malware detector. J. Comput. Virol. 5(3): 263-270 (2009) - [c17]Guillaume Bonfante, Bruno Guillaume, Mathieu Morey:
Dependency Constraints for Lexical Disambiguation. IWPT 2009: 242-253 - [c16]Guillaume Bonfante, Jean-Yves Marion, Daniel Reynaud-Plantey:
A Computability Perspective on Self-Modifying Programs. SEFM 2009: 231-239 - 2008
- [c15]Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem:
Recursion Schemata for NCk. CSL 2008: 49-63 - [c14]Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion:
Morphological detection of malware. MALWARE 2008: 1-8 - 2007
- [j3]Guillaume Bonfante, Jean-Yves Marion:
Foreword. J. Comput. Virol. 3(1): 1-2 (2007) - [c13]Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion:
A Classification of Viruses Through Recursion Theorems. CiE 2007: 73-82 - [c12]Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux:
Quasi-interpretation Synthesis by Decomposition. ICTAC 2007: 410-424 - [c11]Guillaume Bonfante, Yves Guiraud:
Intensional Properties of Polygraphs. TERMGRAPH@ETAPS 2007: 65-77 - [i1]Guillaume Bonfante, Yves Guiraud:
Intensional properties of polygraphs. CoRR abs/cs/0703007 (2007) - 2006
- [j2]Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion:
On Abstract Computer Virology from a Recursion Theoretic Perspective. J. Comput. Virol. 1(3-4): 45-54 (2006) - [c10]Guillaume Bonfante:
Some Programming Languages for Logspace and Ptime. AMAST 2006: 66-80 - [c9]Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem:
Towards an Implicit Characterization of NCk. CSL 2006: 212-224 - [c8]Guillaume Bonfante, Jean-Yves Marion, Romain Péchoux:
A Characterization of Alternating Log Time by First Order Functional Programs. LPAR 2006: 90-104 - [c7]Guillaume Bonfante, Joseph Le Roux, Guy Perrier:
Lexical Disambiguation with Polarities and Automata. CIAA 2006: 283-284 - 2005
- [c6]Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion:
Toward an Abstract Computer Virology. ICTAC 2005: 579-593 - [c5]Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen:
Quasi-interpretations and Small Space Bounds. RTA 2005: 150-164 - 2004
- [c4]Guillaume Bonfante, Bruno Guillaume, Guy Perrier:
Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation. COLING 2004 - 2001
- [j1]Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet:
Algorithms with polynomial interpretation termination proof. J. Funct. Program. 11(1): 33-53 (2001) - [c3]Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen:
On Lexicographic Termination Ordering with Space Bound Certifications. Ershov Memorial Conference 2001: 482-493 - [c2]Guillaume Bonfante, Philippe de Groote:
Stochastic Lambek Categorial Grammars. FGMOL 2001: 34-40 - 2000
- [b1]Guillaume Bonfante:
Constructions d'ordres, analyse de la complexité. National Polytechnic Institute of Lorraine, Nancy, France, 2000
1990 – 1999
- 1998
- [c1]Guillaume Bonfante, Adam Cichon, Jean-Yves Marion, Hélène Touzet:
Complexity Classes and Rewrite Systems with Polynomial Interpretation. CSL 1998: 372-384
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
