cTI : un outil pour l’inférence de conditions optimales de terminaison pour Prolog

Abstract : Termination is a crucial aspect of program termination. This paper describes our tool named cTI for inferring sufficient termination conditions from any Prolog program text. We adopt a bottom-up approach where we try t characterize, for each relation defined in a program, the set of universally left-terminating queries. We present the architecture of our implementation. We benchmark cTI against sixty programs which sizes range from a few to several hundred clauses. At last, we discuss our current work on checking the optimality of terminating conditions.
Document type :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

http://hal.univ-reunion.fr/hal-01921705
Contributor : Réunion Univ <>
Submitted on : Wednesday, November 14, 2018 - 8:38:55 AM
Last modification on : Thursday, March 28, 2019 - 11:24:11 AM
Long-term archiving on : Friday, February 15, 2019 - 12:42:29 PM

File

CTI_un_outil_pour_inference_co...
Explicit agreement for this submission

Identifiers

  • HAL Id : hal-01921705, version 1

Collections

Citation

Frédéric Mesnard, Ulrich Neumerkel, Etienne Payet. cTI : un outil pour l’inférence de conditions optimales de terminaison pour Prolog. 10eme Journées francophones de programmation logique et programmation par contraintes ( JFPLC’2001), Association Française pour la Programmation en Logique et la programmation par Contraintes (AFPLC), Apr 2001, Paris, France. pp.271-286. ⟨hal-01921705⟩

Share

Metrics

Record views

33

Files downloads

5