default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVincent Hugot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Yohan Boichut, Vincent Hugot, Adrien Boiret:
SAT-Based Automated Completion for Reachability Analysis. CIAA 2024: 79-93- 2021
- [c8]Vincent Hugot, Adrien Jousse, Christian Toinard, Benjamin Venelle:
A safe dynamic access control providing mandatory automotive cybersecurity. CSCI 2021: 848-851
2010 – 2019
- 2019
- [j4]Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen:
Logics for unordered trees with data constraints. J. Comput. Syst. Sci. 104: 149-164 (2019) - 2017
- [j3]Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen:
Automata for unordered trees. Inf. Comput. 253: 304-335 (2017) - [j2]Pierre-Cyrille Héam
, Vincent Hugot, Olga Kouchnarenko:
The emptiness problem for tree automata with at least one global disequality constraint is NP-hard. Inf. Process. Lett. 118: 6-9 (2017) - [c7]Vincent Hugot, Adrien Boiret, Joachim Niehren:
Equivalence of Symbolic Tree Transducers. DLT 2017: 109-121 - 2015
- [c6]Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen:
Logics for Unordered Trees with Data Constraints on Siblings. LATA 2015: 175-187 - 2014
- [c5]Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen:
Deterministic Automata for Unordered Trees. GandALF 2014: 189-202 - [i1]Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard. CoRR abs/1412.0839 (2014) - 2013
- [b1]Vincent Hugot:
Tree automata, approximations, and constraints for verification : Tree (Not quite) regular model-checking. (Automates d'arbres, approximations et contraintes pour la vérification : Model-checking d'arbres (pas tout à fait) régulier). University of Franche-Comté, Besançon, France, 2013 - 2012
- [j1]Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
Loops and overloops for Tree-Walking Automata. Theor. Comput. Sci. 450: 43-53 (2012) - [c4]Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
From Linear Temporal Logic Properties to Rewrite Propositions. IJCAR 2012: 316-331 - [c3]Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
On Positive TAGED with a Bounded Number of Constraints. CIAA 2012: 329-336 - 2011
- [c2]Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
Loops and Overloops for Tree Walking Automata. CIAA 2011: 166-177 - 2010
- [c1]Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko:
SAT Solvers for Queries over Tree Automata with Constraints. ICST Workshops 2010: 343-348
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 2024-09-13 01:41 CEST 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:
