Efficient computation of fixpoints that arise in abstract interpretation

Program analysis is critical to many software engineering tools. However, modern programming languages make use of a number of constructs that greatly complicate dataflow analyses, for example, unrestricted pointers, higher-order functions, and dynamic allocation. Program analyses based on abstract interpretation are a promising means of analyzing these difficult constructs. Unfortunately, abstract interpretation often gives rise to complex and expensive fixpoint computations. If it is to become a practical and widely used technique, the problem of computing these fixpoints efficiently must be addressed and overcome.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Chen, Li-Ling

Contributors dc:contributor

• Kamin, Samuel N.

• Computer Science

Statement dc:rights

• Copyright 1994 Chen, Li-Ling

Language dc:language

eng

Identifier

AAI9522090
(UMI)AAI9522090

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/21916