Towards an Abstract Domain for Resource Analysis of Logic Programs Using Sized Types

TL;DR

This paper introduces a new resource analysis method for logic programs using sized types, enabling precise inference of resource bounds based on term sizes, integrated within the CiaoPP framework.

Contribution

It develops a novel abstract domain based on sized types for resource analysis, improving precision and overcoming limitations of prior methods.

Findings

Enhanced precision in resource bounds inference.

Integration with CiaoPP improves analysis capabilities.

Outperforms previous resource analysis approaches.

Abstract

We present a novel general resource analysis for logic programs based on sized types.Sized types are representations that incorporate structural (shape) information and allow expressing both lower and upper bounds on the size of a set of terms and their subterms at any position and depth. They also allow relating the sizes of terms and subterms occurring at different argument positions in logic predicates. Using these sized types, the resource analysis can infer both lower and upper bounds on the resources used by all the procedures in a program as functions on input term (and subterm) sizes, overcoming limitations of existing analyses and enhancing their precision. Our new resource analysis has been developed within the abstract interpretation framework, as an extension of the sized types abstract domain, and has been integrated into the Ciao preprocessor, CiaoPP. The abstract domain operations are integrated with the setting up and solving of recurrence equations for both, inferring size and resource usage functions. We show that the analysis is an improvement over the previous resource analysis present in CiaoPP and compares well in power to state of the art systems.