Abstract
This chapter presents the abstract domain of polyhedra, where each facet can be described by an inequality that has at most two non-zero variables. These so-called TVPI polyhedra form a proper subset of general convex polyhedra.
Keywords
Convex Hull Triangular Matrix Interval Bound Abstract Domain Linear Programming Algorithm
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
Copyright information
© Springer-Verlag London Limited 2008