Formal Verification of Termination Criteria for First-Order Recursive Functions-Reference-Cited by-同舟云学术

Formal Verification of Termination Criteria for First-Order Recursive Functions

Published:2023-11-29 Issue:4 Volume:67 Page:
ISSN:0168-7433
Container-title:Journal of Automated Reasoning
language:en
Short-container-title:J Autom Reasoning

Author:

Muñoz Cesar A.,Ayala-Rincón Mauricio,Moscato Mariano M.^ORCID,Dutle Aaron M.,Narkawicz Anthony J.,Almeida Ariane Alves,da Silva Andréia B. Avelar,Ramos Thiago M. Ferreira

Funder

NASA/NIA

Conselho Nacional de Desenvolvimento Científico e Tecnológico

Fundação de Apoio á Pesquisa do Distrito Federal

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computational Theory and Mathematics,Software

Link

https://link.springer.com/content/pdf/10.1007/s10817-023-09669-z.pdf

Reference24 articles.

1. Abel, A.: foetus—Termination Checker for Simple Functional Programs. Programming Lab Report 474, LMU München (1998). http://www.cse.chalmers.se/~abela/foetus/

2. Alves Almeida, A.: On Termination by Dependency Pairs and Termination of First-Order Functional Specifications in PVS. Ph.D. thesis, Universidade de Brasília, Graduate Program in Informatics, Brasília, Distrito Federal, Brazil (2021). https://repositorio.unb.br/handle/10482/42296

3. Alves Almeida, A., Ayala-Rincón, M.: Formalizing the dependency pair criterion for innermost termination. Sci. Comput. Program. 195, 102474 (2020). https://doi.org/10.1016/j.scico.2020.102474

4. Avelar, A.B.: Formalização da automação da terminação através de grafos com matrizes de medida. Ph.D. thesis, Universidade de Brasília, Departamento de Matemática, Brasília, Distrito Federal, Brazil (2015). https://repositorio.unb.br/handle/10482/18069. (In Portuguese)

5. Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development—Coq’Art: The Calculus of Inductive Constructions. Springer-Verlag Berlin Heidelberg (2004). https://doi.org/10.1007/978-3-662-07964-5