Abstract interpretation meets convex optimization
نویسندگان
چکیده
منابع مشابه
Abstract interpretation meets convex optimization
Interpretation Meets Convex Optimization ? Thomas Martin Gawlitza, Helmut Seidl, Assalé Adjé, Stephane Gaubert, and Eric Goubault 1 CNRS/VERIMAG, France [email protected] 2 Technische Universität München, Germany [email protected] 3 CEA, LIST and LIX, Ecole Polytechnique (MeASI) [email protected] 4 INRIA Saclay and CMAP, Ecole Polytechnique, F-91128 Palaiseau Cedex, France Stephane.Gaubert...
متن کاملProcess Mining Meets Abstract Interpretation
The discovery of process models out of system traces is an interesting problem that has received significant attention in the last years. In this work, a theory for the derivation of a Petri net from a set of traces is presented. The method is based on the theory of abstract interpretation, which has been applied successfully in other areas. The principal application of the theory presented is ...
متن کاملDonut Domains: Efficient Non-convex Domains for Abstract Interpretation
Program analysis using abstract interpretation has been successfully applied in practice to find runtime bugs or prove software correct. Most abstract domains that are used widely rely on convexity for their scalability. However, the ability to express non-convex properties is sometimes required in order to achieve a precise analysis of some numerical properties. This work combines already know...
متن کاملMultitask learning meets tensor factorization: task imputation via convex optimization
We study a multitask learning problem in which each task is parametrized by a weight vector and indexed by a pair of indices, which can be e.g, (consumer, time). The weight vectors can be collected into a tensor and the (multilinear-)rank of the tensor controls the amount of sharing of information among tasks. Two types of convex relaxations have recently been proposed for the tensor multilinea...
متن کاملOn Optimality Conditions for Abstract Convex Vector Optimization Problems
A sequential optimality condition characterizing the efficient solution without any constraint qualification for an abstract convex vector optimization problem is given in sequential forms using subdifferentials and 2-subdifferentials. Another sequential condition involving only the subdifferentials, but at nearby points to the efficient solution for constraints, is also derived. Moreover, we p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2012
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2011.12.048