Formal Verification of Termination Criteria for First-Order Recursive Functions
暂无分享,去创建一个
Mariano M. Moscato | César A. Muñoz | Mauricio Ayala-Rincón | Thiago Mendonça Ferreira Ramos | Anthony Narkawicz | Aaron Dutle | Andréia B. Avelar | Ariane Alves Almeida | Aaron Dutle | C. Muñoz | M. Ayala-Rincón | Anthony Narkawicz
[1] Andreas Abel. foetus - Termination Checker for Simple Functional Programs , 2002 .
[2] Robert W. Floyd,et al. Assigning Meanings to Programs , 1993 .
[3] Daron Vroon,et al. Automatically Proving the Termination of Functional Programs , 2007 .
[4] Alexander Krauss,et al. Certified Size-Change Termination , 2007, CADE.
[5] Yves Bertot,et al. Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions , 2010 .
[6] Panagiotis Manolios,et al. Computer-Aided Reasoning: An Approach , 2011 .
[7] Mariano M. Moscato,et al. Formalization of the Undecidability of the Halting Problem for a Functional Language , 2018, WoLLIC.
[8] Panagiotis Manolios,et al. Termination Analysis with Calling Context Graphs , 2006, CAV.
[9] Neil D. Jones,et al. The size-change principle for program termination , 2001, POPL '01.
[10] Natarajan Shankar,et al. PVS: A Prototype Verification System , 1992, CADE.
[11] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[12] Andréia Borges Avelar. Formalização da automação da terminação através de grafos com matrizes de medida , 2015 .
[13] Ariane Alves Almeida,et al. Formalizing the Dependency Pair Criterion for Innermost Termination , 2019, Sci. Comput. Program..
[14] Robert S. Boyer,et al. Computational Logic , 1990, ESPRIT Basic Research Series.
[15] A. M. Turing,et al. Checking a large routine , 1989 .