Improving Precision of Type Analysis Using Non-Discriminative Union

Details Improving Precision of Type Analysis Using Non-Discriminative Union Improving Precision of Type Analysis Using Non-Discriminative Union

2006-12-12

arxiv.org/abs/cs/0612063v1

Theory and Practice of Logic Programming, 8 (1): 33-80, 2008

Computer Science

Programming Languages

47 pages, 5 tables, to appear in Theory and Practice of Logic Programming

Scientific paper

This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type constructors. Non-discriminative union is used to join type information from different sources without loss of precision. An operation that is performed repeatedly during an analysis is to detect if a fixpoint has been reached. This is reduced to checking the emptiness of types. Due to the use of non-discriminative union, the fundamental problem of checking the emptiness of types is more complex in the proposed type analysis than in other type analyses with a priori type definitions. The experimental results, however, show that use of tabling reduces the effect to a small fraction of analysis time on a set of benchmarks. Keywords: Type analysis, Non-discriminative union, Abstract interpretation, Tabling

Affiliated with

Also associated with

No associations

Rating

Improving Precision of Type Analysis Using Non-Discriminative Union does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improving Precision of Type Analysis Using Non-Discriminative Union, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improving Precision of Type Analysis Using Non-Discriminative Union will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-117609