Automatické nalezení lineárních vztahů mezi proměnnými programu

Abstract

The aim of this work is to design and to implement an algorithm for automatic discovery of linear restraints among variables of a program. Linear restraints are described by linear equations and inequalities, which can form a mathematical object named Polyhedron in n-dimensional space. This Polyhedron will be used as an essential object for computations in this design. Input program will be read from a text file. Output will be linear restraints for each node of an input program. The variables of linear restraints will be variables of the input program. The topic of this work belongs to subarea of Static Analysis of programs called Abstract interpretation.