default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYohan Boichut
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Yohan Boichut, Vincent Hugot, Adrien Boiret:
SAT-Based Automated Completion for Reachability Analysis. CIAA 2024: 79-93
2010 – 2019
- 2019
- [j5]Yohan Boichut, Jacques Chabin, Pierre Réty:
Towards more precise rewriting approximations. J. Comput. Syst. Sci. 104: 131-148 (2019) - [c16]Yohan Boichut, Jean-Michel Couvreur, Xavier Ferry, Mohamadou Tafsir Sakho:
Modeling Concurrent Behaviors as Words. VECoS 2019: 1-15 - 2018
- [c15]Yohan Boichut, Vivien Pelletier, Pierre Réty:
Approximating Any Logic Program by a CS-Program. WRLA@ETAPS 2018: 245-260 - 2016
- [c14]Yohan Boichut, Vivien Pelletier, Pierre Réty:
Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems. WRLA 2016: 64-81 - 2015
- [c13]Yohan Boichut, Jacques Chabin, Pierre Réty:
Towards More Precise Rewriting Approximations. LATA 2015: 652-663 - 2013
- [c12]Yohan Boichut, Jacques Chabin, Pierre Réty:
Over-approximating Descendants by Synchronized Tree Languages. RTA 2013: 128-142 - 2012
- [c11]Yohan Boichut, Benoît Boyer, Thomas Genet, Axel Legay:
Equational Abstraction Refinement for Certified Tree Regular Model Checking. ICFEM 2012: 299-315 - 2011
- [j4]Yohan Boichut, Jean-Michel Couvreur, Duy-Tùng Nguyên:
Functional term rewriting systems towards symbolic model-checking. Int. J. Crit. Comput. Based Syst. 2(3/4): 378-408 (2011) - [c10]Yohan Boichut, Thi-Bich-Hanh Dao, Valérie Murat:
Characterizing Conclusive Approximations by Logical Formulae. RP 2011: 72-84
2000 – 2009
- 2009
- [j3]Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko
:
Handling Non Left-Linear Rules when Completing Tree Automata. Int. J. Found. Comput. Sci. 20(5): 837-849 (2009) - [c9]Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko:
How to Tackle Integer Weighted Automata Positivity. RP 2009: 79-92 - [c8]Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko:
Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives. INFINITY 2009: 57-72 - 2008
- [j2]Yohan Boichut, Pierre-Cyrille Héam:
A theoretical limit for safety verification techniques with regular fix-point computations. Inf. Process. Lett. 108(1): 1-2 (2008) - [j1]Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko:
Approximation-based Tree Regular Model-Checking. Nord. J. Comput. 14(3): 216-241 (2008) - [c7]Emilie Balland, Yohan Boichut, Thomas Genet, Pierre-Etienne Moreau:
Towards an Efficient Implementation of Tree Automata Completion. AMAST 2008: 67-82 - [c6]Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko:
Finer Is Better: Abstraction Refinement for Rewriting Approximations. RTA 2008: 48-62 - [c5]Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko:
Handling Left-Quadratic Rules When Completing Tree Automata. RP 2008: 61-70 - 2007
- [c4]Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luka Le Roux:
Rewriting Approximations for Fast Prototyping of Static Analyzers. RTA 2007: 48-62 - 2006
- [c3]Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko:
Handling Algebraic Properties in Automatic Analysis of Security Protocols. ICTAC 2006: 153-167 - [c2]Yohan Boichut, Thomas Genet:
Feasible Trace Reconstruction for Rewriting Approximations. RTA 2006: 123-135 - 2005
- [c1]Alessandro Armando, David A. Basin, Yohan Boichut, Yannick Chevalier, Luca Compagna, Jorge Cuéllar, Paul Hankes Drielsma, Pierre-Cyrille Héam, Olga Kouchnarenko, Jacopo Mantovani, Sebastian Mödersheim, David von Oheimb, Michaël Rusinowitch, Judson Santiago, Mathieu Turuani, Luca Viganò, Laurent Vigneron:
The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications. CAV 2005: 281-285
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 00:40 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:
