Publications

updated 2018, September 7th

International Journal

[BCR17]
Y. Boichut, J. Chabin and P. Rety. Towards more Precise Rewriting Approximations. In Journal of Computer and System Sciences, to appear in 2017.
[BCN11]
Y. Boichut, J.-M. Couvreur and D.-T. Nguyen. Functional Term Rewriting Systems towards Symbolic Model-Checking. In International Journal of Critical Computer-Based Systems, to appear in 2011.

[BCN11]
Y. Boichut, J.-M. Couvreur and D.-T. Nguyen. Functional Term Rewriting Systems towards Symbolic Model-Checking. In International Journal of Critical Computer-Based Systems, to appear in 2011.

[BHK09]
Y. Boichut, P.-C. Heam and O. Kouchnarenko. Handling Non Left-Linear Rules When Completing Tree Automata. In International Journal of Foundations of Computer Science, to appear in 2009.

[BHK08]
Y. Boichut, P.-C. Heam and O. Kouchnarenko. Aproximation-based Tree Regular Model-Checking. In Nordic Journal of Computing, vol. 14:194-219

[BH08]
Y. Boichut and P.-C. Heam. A Theoretical Limit for Safety Verification Techniques with Regular Fix-point Computations. In Information Processing Letters, to appear 2008.

National Journal

[BHK07]
Y. Boichut, P.-C. Heam, O. Kouchnarenko. Vérifier automatiquement les protocoles de sécurité. In Techniques de l'Ingénieur -- Recherche et innovation, October 2007.

International Conferences and Workshops

[BRP18]
Y. Boichut, P. Rety and V. Pelletier Approximating any Logic Program by a CS-Program. In 12th international Workshop, WRLA 2018, Thessaloniki, Lecture Notes in Computer Science, 11152. 2018.

[BRP16]
Y. Boichut, P. Rety and V. Pelletier Synchronized Tree Languages for Reachability in Non-right-linear Term Rewriting Systems. In 11th international Workshop, WRLA 2016, Eindhoven, Lecture Notes in Computer Science, vol. 9942. 2016.

[BCR15]
Y. Boichut, J. Chabin and P. Rety Towards More Precise Rewriting Approximations. In Proceedings of 9th International Conference on Language and Automata Theory and Applications, Nice (France), Lecture Notes in Computer Science, vol. 8977. 2015.

[BCR13]
Y. Boichut, J. Chabin and P. Rety Over-approximating Descendants by Synchronized Tree Languages. In Proceedings of 24th International Conference on Rewriting Techniques and Applications, Eindhoven (Netherlands), LIPIcs, vol. 21. 2013.
ERRATUM available here
[BBGL12]
Y. Boichut, B. Boyer, Th. Genet and A. Legay Equational Abstraction Refinement for Certified Tree Regular Model Checking.. In Proceedings of the 14th International Conference on Formal Engineering Methods , Lecture Notes in Computer Science, vol. 7635. 2012.

[BDM11]
Y. Boichut, Thi-Bich-Hanh Dao and Valérie Murat. Characterizing Conclusive Approximations by Logical Formulae. Proceedings of 5th International Workshop on Reachability Problems , Lecture Notes in Computer Science, vol. 6945. 2011.

[BHK09a]
Y. Boichut, P.-C. Héam and O. Kouchnarenko How to Tackle Integer Weighted Automata Positivity.. In Proceedings of 3rd International Workshop on Reachability Problems , to appear in Lecture Notes in Computer Science. 2009.

[BHK09b] (.pdf)
Y. Boichut, P.-C. Heam, O. Kouchnarenko. Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives. Electronic Notes of Theoretical Computer Science, INFINITY'06-07, 17487:57-72, 2009

[BCHK08a]
Y. Boichut, R. Courbis, P.-C. Heam and O. Kouchnarenko. Handling Left-Quadratic Rules When Completing Tree Automata. Electronic Notes of Theoretical Computer Science, RP'08, 223:61-70, 2008.

[BBGM08]
E. Balland, Y. Boichut, Th. Genet and P.-E. Moreau. Towards an Efficient Implementation of Tree Automata Completion. In Proceedings of 12th International Conference on Algebraic Methodology and Software Technology, Urbana (USA), to appear in Lecture Notes in Computer Science. 2008.

[BCHK08b] (.pdf)
Y. Boichut, R. Courbis, P.-C. Héam and O. Kouchnarenko Finer is better: Abstraction Refinement for Rewriting Approximations. In Proceedings of 19th International Conference on Rewriting Techniques and Applications, Hagenberg (Austria), to appear in Lecture Notes in Computer Science. 2008.

[BGGH07] (.pdf)
Y. Boichut, T. Genet, Y. Glouche, O. Heen. Using Animation to Improve Formal Specifications of Security Protocols. In Proceedings of the 2nd National Conference on Security in Network Architectures and Information Systems, Annecy (France), 2007.

[BGJL07] (.pdf)
Y. Boichut, T. Genet, T. Jensen, L. Le Roux Rewriting Approximations for Fast Prototyping of Static Analyzers. In Proceedings of the 18th International Conference on Rewriting Techniques and Applications, Paris (France), Volume 4533 of Lecture Notes in Computer Science. Springer, 2007.

[BHK06] (.pdf or .ps )
Y. Boichut, P.-C. Héam and O. Kouchnarenko Handling Algebraic Properties in Automatic Analysis of Security Protocols. In Proceedings of 3rd Int. Colloquium on Theoretical Aspects of Computing, Tunis (Tunisia), volume 4281 of Lecture Notes in Computer Science. Springer-Verlag, 2006.

[BG06] (.pdf)
Y. Boichut and T. Genet Feasible Trace Reconstruction for Rewriting Approximations. In Proceedings of 17th International Conference on Rewriting Techniques and Applications, Seattle (USA), volume 4098 of Lecture Notes in Computer Science. Springer-Verlag, 2006.

[BKV06] (.pdf)
Y. Boichut, N. Kosmatov, and L. Vigneron Validation of Prouvé protocols using the automatic tool TA4SP. In Proceedings of the Third Taiwanese-French Conference on Information Technology (TFIT 2006), Nancy (France), pages 467--480. March 2006.

[AVISPA05] (.ps)
A. Armando, D. Basin, Y. Boichut, Y. Chevalier, L. Compagna, J. Cuellar, P. Hankes Drielsma, P.-C. Héam, O. Kouchnarenko, J. Mantovani, S. Moedersheim, D. von Oheimb, M. Rusinowitch, J. Santiago, M. Turuani, L. Viganò, and L. Vigneron The Avispa Tool for the automated validation of internet security protocols and applications. In Proceedings of 17th Int. Conf. on Computer Aided Verification, Edinburgh, (Scotland, UK), volume 3576 of Lecture Notes in Computer Science. Springer-Verlag, 2005.

[BHKO04] (.ps)
Y. Boichut, P.-C. Héam, O. Kouchnarenko and F. Oehl Improvements on the Genet and Klay Technique to Automatically Verify Security Protocols. In Proceedings of Int. Ws. on Automated Verification of Infinite-State Systems (AVIS'2004), joint to ETAPS'04, Barcelona (Spain), pages 1--11, The final version will be published in EN in Theoretical Computer Science, Elsevier. 2004.


Technical Reports

[RR-BCR15] (link)
Y. Boichut, J. Chabin and P. Réty. Erratum of [BCR13] - Over-approximating Descendants by Synchronized Tree Languages. February 2015.

[RR-BH08] (link)
Y. Boichut and P.-C. Héam. Theoretical Limit for Safety Verification Techniques with Regular Fix-point Computations. Research report INRIA RR 6411, INRIA, February 2008.

[RR-BHK06] (link)
Y. Boichut, P.-C. Héam and O. Kouchnarenko. Automatic abstraction generation : How to make an expert verification technique for security protocols available to non-expert users. Research report INRIA RR 6039, INRIA, November 2006.

[RR-BGJL06] (.pdf)
Y. Boichut, T. Genet, T. Jensen and L. Le Roux. Rewriting Approximations for Fast Prototyping of Static Analyzers . Research report INRIA RR 5997, October 2006.

[RR-BG06] (.pdf)
Y. Boichut, T. Genet. Trace Reconstruction. Research report RR2006-02, LIFC, February 2006.

[RR-BHK06] (link)
Y. Boichut, P.-C. Héam and O. Kouchnarenko. Handling Algebraic Properties in Automatic Analysis of Security Protocols. Research report INRIA RR 5857, INRIA, March 2006.

[RR-BHK05] (link)
Y. Boichut, P.-C. Héam and O. Kouchnarenko. Automatic Verification of Security Protocols Using Approximations. Research report INRIA RR 5727, INRIA, October 2005.

[AVDlv6.2]
Y. Boichut, P.-C. Heam, and O. Kouchnarenko. Specification of the Problems in the High-Level Specification Language . Delivrable 6.2, AVISPA project, July 2005. Note: 410 pages, written with others AVISPA members.

[AVDlv4.5]
Y. Boichut, P.-C. Heam, and O. Kouchnarenko. AVISPA tool. Delivrable 4.5, AVISPA project tool vs 2, July 2004. Note: 24 pages, written with others AVISPA members.

[AVDlv5.1]
Y. Boichut, P.-C. Heam, and O. Kouchnarenko. Abstractions. Delivrable 5.1, AVISPA project, April 2004. Note: 30 pages, written with others AVISPA members.

[AVDlv5.2]
Y. Boichut, P.-C. Heam, and O. Kouchnarenko. Infinite State Model Checking. Delivrable 5.2, AVISPA project, September 2003. Note: 30 pages, written with others AVISPA members.


PhD Thesis

[Boi06] (pdf or ps)
Y. Boichut. Approximations pour la vérification automatique de protocoles de sécurité. Thèse de Doctorat d'Université, Université de Franche-Comté - Besançon, 2006.










Back to the Home Page