Yohan Boichut

Available identifiers

Publication	Date of Publication	Type
SAT-based automated completion for reachability analysis	2025-01-20	Paper
Approximating any logic program by a CS-program	2023-07-28	Paper
Towards more precise rewriting approximations	2019-06-25	Paper
Over-approximating descendants by synchronized tree languages	2017-02-01	Paper
Synchronized tree languages for reachability in non-right-linear term rewrite systems	2016-10-21	Paper
Towards more precise rewriting approximations	2016-04-08	Paper
Handling left-quadratic rules when completing tree automata	2015-03-23	Paper
Tree automata for detecting attacks on protocols with algebraic cryptographic primitives	2015-03-19	Paper
Characterizing conclusive approximations by logical formulae	2011-10-07	Paper
A theoretical limit for safety verification techniques with regular fix-point computations	2010-04-19	Paper
HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA	2009-11-19	Paper
How to Tackle Integer Weighted Automata Positivity	2009-11-19	Paper
Approximation-based tree regular model-checking	2009-10-12	Paper
Towards an Efficient Implementation of Tree Automata Completion	2009-01-27	Paper
Feasible Trace Reconstruction for Rewriting Approximations	2008-09-25	Paper
Handling Algebraic Properties in Automatic Analysis of Security Protocols	2008-09-11	Paper
Finer Is Better: Abstraction Refinement for Rewriting Approximations	2008-08-28	Paper

This page was built for person: Yohan Boichut