Improved precision in polyhedral analysis with wrapping
نویسندگان
چکیده
منابع مشابه
Improved precision in polyhedral analysis with wrapping
Abstract interpretation using convex polyhedra is a common and powerful program analysis technique to discover linear relationships among variables in a program. However, the classical way of performing polyhedral analysis does not model the fact that values typically are stored as fixed-size binary strings and usually have wrap-around semantics in the case of overflows. In resource-constrained...
متن کاملFully Bounded Polyhedral Analysis of Integers with Wrapping
Analysis of convex polyhedra using abstract interpretation is a common and powerful program analysis technique to discover linear relationships among variables in a program. However, the classical way of performing polyhedral analysis does not model the fact that values typically are stored as fixed-size binary strings and usually have a wrap-around semantics in the case of overflows. In embedd...
متن کاملRobust portfolio selection with polyhedral ambiguous inputs
Ambiguity in the inputs of the models is typical especially in portfolio selection problem where the true distribution of random variables is usually unknown. Here we use robust optimization approach to address the ambiguity in conditional-value-at-risk minimization model. We obtain explicit models of the robust conditional-value-at-risk minimization for polyhedral and correlated polyhedral am...
متن کاملExploiting Sparsity in Polyhedral Analysis
The intrinsic cost of polyhedra has lead to research on more tractable sub-classes of linear inequalities. Rather than committing to the precision of such a sub-class, this paper presents a projection algorithm that works directly on any sparse system of inequalities and which sacrifices precision only when necessary. The algorithm is based on a novel combination of the Fourier-Motzkin algorith...
متن کاملImproved Muscle Wrapping Algorithms Using Explicit Path-Error Jacobians
Muscle wrapping computations are an important feature in musculoskeletal simulations. In this paper we present a novel Jacobian-based method for linebased muscle-path computations over multiple general smooth surfaces allowing for second-order Newton-Raphson iterations. The method is based on the analytical determination of infinitesimal displacements along geodesics using Jacobi fields. It doe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2017
ISSN: 0167-6423
DOI: 10.1016/j.scico.2016.07.006