184 search results - page 4 / 37 » Integer Polyhedra for Program Analysis |
SIAMDM
2011
13 years 2 months ago
2011
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...
ICDAR
2007
IEEE
14 years 2 months ago
2007
IEEE
ESOP
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
SAS
2009
Springer
14 years 8 months ago
2009
Springer
Polyhedra: An Abstract Domain to Infer Interval Linear Relationships Liqian Chen1,2 , Antoine Min?e2,3 , Ji Wang1 , and Patrick Cousot2,4 1 National Laboratory for Parallel and Dis...
MP
2007
13 years 7 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...