[1]

Richard Bonichon, Géraud Canet, Loïc Correnson, Eric Goubault, Emmanuel Haucourt, Michel Hirschowitz, Sébastien Labbé, and Samuel Mimram. Rigorous evidence of freedom from concurrency faults in industrial control software. In Francesco Flammini, Sandro Bologna, and Valeria Vittorini, editors, SAFECOMP, volume 6894 of Lecture Notes in Computer Science, pages 85–98. Springer, 2011. [ bib ]

[2]

Richard Bonichon and Pascal Cuoq. A mergeable interval map. Stud. Inform. Univ., 9(1):5–37, 2011. [ bib ]

[3]

Pascal Cuoq, Julien Signoles, Patrick Baudin, Richard Bonichon, Géraud Canet, Loïc Correnson, Benjamin Monate, Virgile Prevosto, and Armand Puccetti. Experience report: Ocaml for an industrial-strength static analysis framework. In Graham Hutton and Andrew P. Tolmach, editors, ICFP, pages 281–286. ACM, 2009. [ bib ]

[4]

Richard Bonichon, David Delahaye, and Damien Doligez. Zenon : An extensible automated theorem prover producing checkable proofs. In Nachum Dershowitz and Andrei Voronkov, editors, LPAR, volume 4790 of Lecture Notes in Computer Science, pages 151–165. Springer, 2007. [ bib ]

[5]

Richard Bonichon and Olivier Hermant. On constructive cut admissibility in deduction modulo. In Thorsten Altenkirch and Conor McBride, editors, TYPES, volume 4502 of Lecture Notes in Computer Science, pages 33–47. Springer, 2006. [ bib ]

[6]

Richard Bonichon and Olivier Hermant. A semantic completeness proof for tamed. In Miki Hermann and Andrei Voronkov, editors, LPAR, volume 4246 of Lecture Notes in Computer Science, pages 167–181. Springer, 2006. [ bib ]

[7]

Richard Bonichon. Tamed: A tableau method for deduction modulo. In David A. Basin and Michaël Rusinowitch, editors, IJCAR, volume 3097 of Lecture Notes in Computer Science, pages 445–459. Springer, 2004. [ bib ]

This file was generated by bibtex2html 1.98.