Yohan Boichut

According to our database1, Yohan Boichut authored at least 20 papers between 2005 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 


On csauthors.net:


Towards more precise rewriting approximations.
J. Comput. Syst. Sci., 2019

Modeling Concurrent Behaviors as Words.
Proceedings of the Verification and Evaluation of Computer and Communication Systems, 2019

Approximating Any Logic Program by a CS-Program.
Proceedings of the Rewriting Logic and Its Applications - 12th International Workshop, 2018

Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems.
Proceedings of the Rewriting Logic and Its Applications - 11th International Workshop, 2016

Over-approximating Descendants by Synchronized Tree Languages.
Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

Equational Abstraction Refinement for Certified Tree Regular Model Checking.
Proceedings of the Formal Methods and Software Engineering, 2012

Functional term rewriting systems towards symbolic model-checking.
Int. J. Crit. Comput. Based Syst., 2011

Characterizing Conclusive Approximations by Logical Formulae.
Proceedings of the Reachability Problems - 5th International Workshop, 2011

Handling Non Left-Linear Rules when Completing Tree Automata.
Int. J. Found. Comput. Sci., 2009

Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives.
Proceedings of the Joint Proceedings of the 8th, 2009

How to Tackle Integer Weighted Automata Positivity.
Proceedings of the Reachability Problems, 3rd International Workshop, 2009

Approximation-based Tree Regular Model-Checking.
Nord. J. Comput., 2008

A theoretical limit for safety verification techniques with regular fix-point computations.
Inf. Process. Lett., 2008

Handling Left-Quadratic Rules When Completing Tree Automata.
Electron. Notes Theor. Comput. Sci., 2008

Finer Is Better: Abstraction Refinement for Rewriting Approximations.
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Towards an Efficient Implementation of Tree Automata Completion.
Proceedings of the Algebraic Methodology and Software Technology, 2008

Rewriting Approximations for Fast Prototyping of Static Analyzers.
Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

Feasible Trace Reconstruction for Rewriting Approximations.
Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

Handling Algebraic Properties in Automatic Analysis of Security Protocols.
Proceedings of the Theoretical Aspects of Computing, 2006

The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications.
Proceedings of the Computer Aided Verification, 17th International Conference, 2005