Convex polyhedra in floating point
monniaux, perin
Abstract
monniaux, perin
Abstract
Advisors: David Monniaux, Michael Perin Convex polyhedra appear in various areas in mathematics and computer science, including static analysis by abstract interpretation. The usual approaches for computing over convex polyhedra, as implemented in mainstream libraries, are based on computations in extended precision integer or rational numbers. This hampers efficiency; we would often prefer to compute everything in floating-point. The goal of the internship is to investigate computations (...)
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Advisors: David Monniaux, Michael Perin Convex polyhedra appear in various areas in mathematics and computer science, including static analysis by abstract interpretation. The usual approaches for computing over convex polyhedra, as implemented in mainstream libraries, are based on computations in extended precision integer or rational numbers. This hampers efficiency; we would often prefer to compute everything in floating-point. The goal of the internship is to investigate computations (...)
Key concepts: Polyhedron, Integer points in convex polyhedra, Convex polytope, Computation, Regular polygon, Interpretation (philosophy), Point (geometry), Integer (computer science)