Name
Abstract | ||
|---|---|---|
In this paper we present an alternative approach to interprocedurally inferring linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of transition matrices. In the absence of conditional branching, this abstraction can be characterised precisely by means of the least solution of a constraint system. In order to handle conditionals, we introduce auxiliary variables and postpone checking them until after the procedure calls. In order to obtain an effective analysis, we approximate convex sets by means of polyhedra. Since our implementation of function composition uses the frame representation of polyhedra, we rely on the subclass of simplices to obtain an efficient implementation. We show that for this abstraction the basic operations can be implemented in polynomial time. First practical experiments indicate that the resulting analysis is quite efficient and provides reasonably precise results. |
Year | Venue | Keywords |
|---|---|---|
2007 | ESOP | linear inequality relation,basic operation,resulting analysis,effective analysis,constraint system,frame representation,efficient implementation,approximate convex set,convex set,alternative approach,auxiliary variable,polynomial time |
Field | DocType | Volume |
Abstraction,Branch,Matrix (mathematics),Computer science,Polyhedron,Regular polygon,Theoretical computer science,Time complexity,Linear inequality,Linear matrix inequality | Conference | 4421 |
ISSN | Citations | PageRank |
0302-9743 | 5 | 0.46 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Helmut Seidl | 1 | 1468 | 103.61 |
| Andrea Flexeder | 2 | 13 | 1.64 |
| Michael Petter | 3 | 13 | 1.64 |