Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools
DOI10.1007/978-3-642-35873-9_11zbMATH Open1426.68063OpenAlexW1547954410MaRDI QIDQ2926643FDOQ2926643
Olivier Bouissou, Yassamine Seladji
Publication date: 3 November 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-35873-9_11
Computational aspects related to convexity (52B55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cited In (2)
Uses Software
Recommendations
- Title not available (Why is that?) π π
- Finite element pointwise results on convex polyhedral domains π π
- Numerical analysis of the efficiency of an algorithm for approximating convex bodies by polyhedra π π
- Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra π π
- Polyhedral and algebraic methods in computational geometry π π
- Approximate convex decomposition of polyhedra and its applications π π
- Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver π π
- Analysis of a new method for approximation of convex compact bodies by polyhedra π π
- Computation of generalized convex approximations of planar geometric objects π π
This page was built for publication: Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2926643)