Proving termination of logic programs by exploiting term properties

DOI10.1007/3540539816_66MaRDI QIDQ2736363zbMATH OpenFDO

Authors Annalisa Bossi, Nicoletta Cocco, M. Fabris

Publication date 29 August 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3540539816_66

Mathematics Subject Classification ID

Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(8)

• Norms on terms and their use in proving universal termination of a logic program
• A declarative approach for first-order built-in's of Prolog
• Reasoning about prolog programs: From modes through types to assertions
• Fast offline partial evaluation of logic programs
• A transformational approach to resource analysis with typed-norms
• A transformational approach to resource analysis with typed-norms inference
• Proving Termination by Invariance Relations
• Termination of floating-point computations

Describes a project that uses

Uses Software

• Miranda
• BABEL

This page was built for publication: Proving termination of logic programs by exploiting term properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2736363)