Author of the publication

On Formalised Proofs of Termination of Recursive Functions.

, and . PPDP, volume 1702 of Lecture Notes in Computer Science, page 29-46. Springer, (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Checking Verifications of Protocols and Distributed Systems by Computer., , and . CONCUR, volume 1466 of Lecture Notes in Computer Science, page 629-655. Springer, (1998)On Automating Inductive and Non-inductive Termination Methods., and . ASIAN, volume 1742 of Lecture Notes in Computer Science, page 177-189. Springer, (1999)On Formalised Proofs of Termination of Recursive Functions., and . PPDP, volume 1702 of Lecture Notes in Computer Science, page 29-46. Springer, (1999)Formal proof of security algorithms based on reachability reduction., , , and . MEDES, page 67-72. ACM, (2016)Est-ce que Prolog sait lire?, and . SPLT, page 131-140. (1987)Work-in-Progress: Toward a Coq-Certified Tool for the Schedulability Analysis of Tasks with Offsets., , , and . RTSS, page 387-389. IEEE Computer Society, (2017)Formal Verification of Netlog Protocols., and . TASE, page 43-50. IEEE Computer Society, (2012)Proving the Correctness of the Standardized Algorithm for ABR Conformance.. Formal Methods Syst. Des., 17 (3): 221-243 (2000)CertiCAN: A Tool for the Coq Certification of CAN Analysis Results., , , and . RTAS, page 182-191. IEEE, (2019)Ecriture d'un compilateur "réel" en PROLOG.. SPLT, (1984)