Yohan Boichut

Publication Activity (10 Years)

Years Active: 2005-2019
Publications (10 Years): 4

Top Topics

Queries Using Views

Approximation Methods

Conjunctive Queries

Top Venues

J. Comput. Syst. Sci.

Publications

Yohan Boichut, Jean-Michel Couvreur, Xavier Ferry, Mohamadou Tafsir Sakho
Modeling Concurrent Behaviors as Words. VECoS (2019)
Yohan Boichut, Jacques Chabin, Pierre Réty
Towards more precise rewriting approximations. J. Comput. Syst. Sci. 104 (2019)
Yohan Boichut, Vivien Pelletier, Pierre Réty
Approximating Any Logic Program by a CS-Program. WRLA@ETAPS (2018)
Yohan Boichut, Vivien Pelletier, Pierre Réty
Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems. WRLA (2016)
Yohan Boichut, Jacques Chabin, Pierre Réty
Towards More Precise Rewriting Approximations. LATA (2015)
Yohan Boichut, Jacques Chabin, Pierre Réty
Over-approximating Descendants by Synchronized Tree Languages. RTA (2013)
Yohan Boichut, Benoît Boyer, Thomas Genet, Axel Legay
Equational Abstraction Refinement for Certified Tree Regular Model Checking. ICFEM (2012)
Yohan Boichut, Thi-Bich-Hanh Dao, Valérie Murat
Characterizing Conclusive Approximations by Logical Formulae. RP (2011)
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) (2011)
Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko
How to Tackle Integer Weighted Automata Positivity. RP (2009)
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) (2009)
Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko
Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives. INFINITY (2009)
Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko
Handling Left-Quadratic Rules When Completing Tree Automata. Electron. Notes Theor. Comput. Sci. 223 (2008)
Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko
Finer Is Better: Abstraction Refinement for Rewriting Approximations. RTA (2008)
Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko
Approximation-based Tree Regular Model-Checking. Nord. J. Comput. 14 (3) (2008)
Yohan Boichut, Pierre-Cyrille Héam
A theoretical limit for safety verification techniques with regular fix-point computations. Inf. Process. Lett. 108 (1) (2008)
Emilie Balland, Yohan Boichut, Thomas Genet, Pierre-Etienne Moreau
Towards an Efficient Implementation of Tree Automata Completion. AMAST (2008)
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luka Le Roux
Rewriting Approximations for Fast Prototyping of Static Analyzers. RTA (2007)
Yohan Boichut, Thomas Genet
Feasible Trace Reconstruction for Rewriting Approximations. RTA (2006)
Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko
Handling Algebraic Properties in Automatic Analysis of Security Protocols. ICTAC (2006)
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)