Pos(T): Analyzing Dependencies in Typed Logic Programs

Authors:
Maurice Bruynooghe;Wim Vanhoof;Michael Codish
Affiliations:
-;-;-
Venue:
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Year:
2001

Citing 19
Cited 7

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Logic programming

Handbook of theoretical computer science (vol. B)
Deriving descriptions of possible values of program variables by means of abstract interpretation

Journal of Logic Programming
Experimental evaluation of a generic abstract interpretation algorithm for PROLOG

ACM Transactions on Programming Languages and Systems (TOPLAS)
Precise and efficient groundness analysis for logic programs

ACM Letters on Programming Languages and Systems (LOPLAS)
Fast and precise regular approximations of logic programs

Proceedings of the eleventh international conference on Logic programming
Program analysis, debugging, and optimization using the ciao system preprocessor

Proceedings of the 1999 international conference on Logic programming
Binding-time analysis for mercury

Proceedings of the 1999 international conference on Logic programming
Combinations of abstract domains for logic programming: open product and generic pattern construction

Science of Computer Programming
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction

ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Typed Static Analysis: Application to Groundness Analysis of PROLOG and lambda-PROLOG

FLOPS '99 Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming
A Framework for Analysis of Typed Logic Programs

FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs

PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Mode Analysis Domains for Typed Logic Programs

LOPSTR'99 Selected papers from the 9th International Workshop on Logic Programming Synthesis and Transformation
A Model for Inter-module Analysis and Optimizing Compilation

LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
An Overview of HAL

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Efficient structural information analysis for real CLP languages

LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Binding-time analysis by constraint solving a modular and higher-order approach for mercury

LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning

Analysis of Polymorphically Typed Logic Programs Using ACI-Unification

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Combining Norms to Prove Termination

VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
When Size Does Matter

LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Reuse of Results in Termination Analysis of Typed Logic Programs

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Termination of Floating-Point Computations

Journal of Automated Reasoning
Termination analysis of logic programs through combination of type-based norms

ACM Transactions on Programming Languages and Systems (TOPLAS)
Inferring non-suspension conditions for logic programs with dynamic scheduling

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dependencies play a major role in the analysis of program properties. The analysis of groundness dependencies for logic programs using the class of positive Boolean functions is a main applications area. The precision of such an analysis can be improved through the integration of either pattern information or type information. This paper develops an approach in which type information is exploited. Different from previous work, a separate simple analysis is performed for each subtype of the types. If the types are polymorphic, then dependencies for specific type instances are derived from the analysis of the polymorphic typed program.