Bachelor and Master Theses

Title: Abstrakt interpretering med avancerade numeriska domäner
Subject: Computer Science
Level: Advanced
Description:

Abstract Interpretation is a framework for static program analysis. The
value in an abstract comain represents a property of the program, e.g., the
set of possible states in a program point, which can be given as constraints
on the values of the program variables in that point. In general, the sets
are overapproximated by the abstract values, and it is desirable to find
approximations that are as exact as possible without the analysis using to
much resources.



For numerical variables, numerical domains are used: these range from simple
intervals, over systems of linear inequalities, and polyhedra, to sets
corresponding to general Presburger formulae. The complexity of the analysis
grows extremely fast with the complexity of the domain. It is desirable to
find the right tradeoff between precision and complexity, for programs that
appear in practice.



The purpose of the thesis project is to gather more knowledge about
numerical domains, and how advanced such domains could be used to increase
the precision of the program analyses that are being developed within the
research group for programming languages at IDE. Interesting candidates may
include intervals extended with strides, or a generalization of this to
general polyhedra intersected with the subspace of integer vectors spanned
by a given set of base vectors. The project contains the following parts:



  1. Study of the basic theory of abstract interpretation, and the "classical"
    numerical domains (intervals, polyhedra).


  2. A literature stury, where a comprehensive search for existing literature
    in the area is made. The result of the search should be a survey, which
    is to be included in the M.Sc. thesis.


  3. If not already present in the literature, development of a new numerical
    domain with a potential to provide a suitable tradeoff between precision
    and complexity. The following should be defined:

    • the elements of the domain

    • operations: LUB, GLB, widening, test for equality, (possibly)
      narrowing, and abstract versions of common numerical operations
      (arithmetic, etc.) and relations. The correctness of the abstract
      operations should be proved.


  4. Possibly, if found suitable, a prototype implementation should be made,
    within the existing WCET tool of the research group.


  5. Report writing, presentation.




The thesis project will be carried out within the WCET analysis project of
the research group.


Company: IDE
Prel. end date: 2005-09-01
Presentation date: 2005-09-01
Student: Stefan Bygde sbe00001@student.mdh.se
IDT supervisor: Björn Lisper
bjorn.lisper@mdh.se, +46-21-151709

Rapport och bilagor

Size

Senaste uppdatering

TR0403.pdf

215912

2007-03-08, 10:22


  • Mälardalen University |
  • Box 883 |
  • 721 23 Västerås/Eskilstuna |
  • 021-101300, 016-153600 |
  • webmaster |
  • Latest update: 2017.03.25