Computer Science – Computational Geometry
Scientific paper
2007-01-19
Computer Science
Computational Geometry
51 pages, 11 figures
Scientific paper
Convex polyhedra are the basis for several abstractions used in static analysis and computer-aided verification of complex and sometimes mission critical systems. For such applications, the identification of an appropriate complexity-precision trade-off is a particularly acute problem, so that the availability of a wide spectrum of alternative solutions is mandatory. We survey the range of applications of polyhedral computations in this area; give an overview of the different classes of polyhedra that may be adopted; outline the main polyhedral operations required by automatic analyzers and verifiers; and look at some possible combinations of polyhedra with other numerical abstractions that have the potential to improve the precision of the analysis. Areas where further theoretical investigations can result in important contributions are highlighted.
Bagnara Roberto
Hill Patricia M.
Zaffanella Enea
No associations
LandOfFree
Applications of Polyhedral Computations to the Analysis and Verification of Hardware and Software Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Applications of Polyhedral Computations to the Analysis and Verification of Hardware and Software Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Applications of Polyhedral Computations to the Analysis and Verification of Hardware and Software Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-70565