Computer Science – Logic in Computer Science
Scientific paper
2009-02-21
Computer Science
Logic in Computer Science
Scientific paper
We consider the problem of formalizing the familiar notion of widening in abstract interpretation in higher-order logic. It turns out that many axioms of widening (e.g. widening sequences are ascending) are not useful for proving correctness. After keeping only useful axioms, we give an equivalent characterization of widening as a lazily constructed well-founded tree. In type systems supporting dependent products and sums, this tree can be made to reflect the condition of correct termination of the widening sequence.
No associations
LandOfFree
A minimalistic look at widening operators 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 A minimalistic look at widening operators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A minimalistic look at widening operators will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-370843