27 research outputs found
Tropical Fourier-Motzkin elimination, with an application to real-time verification
We introduce a generalization of tropical polyhedra able to express both
strict and non-strict inequalities. Such inequalities are handled by means of a
semiring of germs (encoding infinitesimal perturbations). We develop a tropical
analogue of Fourier-Motzkin elimination from which we derive geometrical
properties of these polyhedra. In particular, we show that they coincide with
the tropically convex union of (non-necessarily closed) cells that are convex
both classically and tropically. We also prove that the redundant inequalities
produced when performing successive elimination steps can be dynamically
deleted by reduction to mean payoff game problems. As a complement, we provide
a coarser (polynomial time) deletion procedure which is enough to arrive at a
simply exponential bound for the total execution time. These algorithms are
illustrated by an application to real-time systems (reachability analysis of
timed automata).Comment: 29 pages, 8 figure
Signed Tropical Convexity
We establish a new notion of tropical convexity for signed tropical numbers. We provide several equivalent descriptions involving balance relations and intersections of open halfspaces as well as the image of a union of polytopes over Puiseux series and hyperoperations. Along the way, we deduce a new Farkas\u27 lemma and Fourier-Motzkin elimination without the non-negativity restriction on the variables. This leads to a Minkowski-Weyl theorem for polytopes over the signed tropical numbers
Signed tropicalization of polar cones
We study the tropical analogue of the notion of polar of a cone, working over
the semiring of tropical numbers with signs. We characterize the cones which
arise as polars of sets of tropically nonnegative vectors by an invariance
property with respect to a tropical analogue of Fourier-Motzkin elimination. We
also relate tropical polars with images by the nonarchimedean valuation of
classical polars over real closed nonarchimedean fields and show, in
particular, that for semi-algebraic sets over such fields, the operation of
taking the polar commutes with the operation of signed valuation (keeping track
both of the nonarchimedean valuation and sign). We apply these results to
characterize images by the signed valuation of classical cones of matrices,
including the cones of positive semidefinite matrices, completely positive
matrices, completely positive semidefinite matrices, and their polars,
including the cone of co-positive matrices, showing that hierarchies of
classical cones collapse under tropicalization. We finally discuss an
application of these ideas to optimization with signed tropical numbers.Comment: 24 pages, 1 figure. Changes with respect to Version 2: we improved
Introduction and added Examples 3.24 and 3.25 illustrating that "bend
addition" can be considered as a tropical analogue of the Fourier-Motzkin
eliminatio
When Deep Learning Meets Polyhedral Theory: A Survey
In the past decade, deep learning became the prevalent methodology for
predictive modeling thanks to the remarkable accuracy of deep neural networks
in tasks such as computer vision and natural language processing. Meanwhile,
the structure of neural networks converged back to simpler representations
based on piecewise constant and piecewise linear functions such as the
Rectified Linear Unit (ReLU), which became the most commonly used type of
activation function in neural networks. That made certain types of network
structure \unicode{x2014}such as the typical fully-connected feedforward
neural network\unicode{x2014} amenable to analysis through polyhedral theory
and to the application of methodologies such as Linear Programming (LP) and
Mixed-Integer Linear Programming (MILP) for a variety of purposes. In this
paper, we survey the main topics emerging from this fast-paced area of work,
which bring a fresh perspective to understanding neural networks in more detail
as well as to applying linear optimization techniques to train, verify, and
reduce the size of such networks
Performance evaluation of an emergency call center: tropical polynomial systems applied to timed Petri nets
We analyze a timed Petri net model of an emergency call center which
processes calls with different levels of priority. The counter variables of the
Petri net represent the cumulated number of events as a function of time. We
show that these variables are determined by a piecewise linear dynamical
system. We also prove that computing the stationary regimes of the associated
fluid dynamics reduces to solving a polynomial system over a tropical
(min-plus) semifield of germs. This leads to explicit formul{\ae} expressing
the throughput of the fluid system as a piecewise linear function of the
resources, revealing the existence of different congestion phases. Numerical
experiments show that the analysis of the fluid dynamics yields a good
approximation of the real throughput.Comment: 21 pages, 4 figures. A shorter version can be found in the
proceedings of the conference FORMATS 201
Decision procedures for linear arithmetic
In this thesis, we present new decision procedures for linear arithmetic in the context of SMT solvers and theorem provers: 1) CutSat++, a calculus for linear integer arithmetic that combines techniques from SAT solving and quantifier elimination in order to be sound, terminating, and complete. 2) The largest cube test and the unit cube test, two sound (although incomplete) tests that find integer and mixed solutions in polynomial time. The tests are especially efficient on absolutely unbounded constraint systems, which are difficult to handle for many other decision procedures. 3) Techniques for the investigation of equalities implied by a constraint system. Moreover, we present several applications for these techniques. 4) The Double-Bounded reduction and the Mixed-Echelon-Hermite transformation, two transformations that reduce any constraint system in polynomial time to an equisatisfiable constraint system that is bounded. The transformations are beneficial because they turn branch-and-bound into a complete and efficient decision procedure for unbounded constraint systems. We have implemented the above decision procedures (except for Cut- Sat++) as part of our linear arithmetic theory solver SPASS-IQ and as part of our CDCL(LA) solver SPASS-SATT. We also present various benchmark evaluations that confirm the practical efficiency of our new decision procedures.In dieser Arbeit prĂ€sentieren wir neue Entscheidungsprozeduren fĂŒr lineare Arithmetik im Kontext von SMT-Solvern und Theorembeweisern: 1) CutSat++, ein korrekter und vollstĂ€ndiger KalkĂŒl fĂŒr ganzzahlige lineare Arithmetik, der Techniken zur Entscheidung von Aussagenlogik mit Techniken aus der Quantorenelimination vereint. 2) Der GröĂte-WĂŒrfeltest und der EinheitswĂŒrfeltest, zwei korrekte (wenn auch unvollstĂ€ndige) Tests, die in polynomieller Zeit (gemischt-)ganzzahlige Lösungen finden. Die Tests sind besonders effizient auf vollstĂ€ndig unbegrenzten Systemen, welche fĂŒr viele andere Entscheidungsprozeduren schwer sind. 3) Techniken zur Ermittlung von Gleichungen, die von einem linearen Ungleichungssystem impliziert werden. Des Weiteren prĂ€sentieren wir mehrere Anwendungsmöglichkeiten fĂŒr diese Techniken. 4) Die Beidseitig-Begrenzte-Reduktion und die Gemischte-Echelon-Hermitesche- Transformation, die ein Ungleichungssystem in polynomieller Zeit auf ein erfĂŒllbarkeitsĂ€quivalentes System reduzieren, das begrenzt ist. Vereint verwandeln die Transformationen Branch-and-Bound in eine vollstĂ€ndige und effiziente Entscheidungsprozedur fĂŒr unbeschrĂ€nkte Ungleichungssysteme. Wir haben diese Techniken (ausgenommen CutSat++) in SPASS-IQ (unserem theory solver fĂŒr lineare Arithmetik) und in SPASS-SATT (unserem CDCL(LA) solver) implementiert. Basierend darauf prĂ€sentieren wir Benchmark-Evaluationen, die die Effizienz unserer Entscheidungsprozeduren bestĂ€tigen
Automating Program Verification and Repair Using Invariant Analysis and Test Input Generation
Software bugs are a persistent feature of daily life---crashing web browsers, allowing cyberattacks, and distorting the results of scientific computations. One approach to improving software uses program invariants---mathematical descriptions of program behaviors---to verify code and detect bugs. Current invariant generation techniques lack support for complex yet important forms of invariants, such as general polynomial relations and properties of arrays. As a result, we lack the ability to conduct precise analysis of programs that use this common data structure. This dissertation presents DIG, a static and dynamic analysis framework for discovering several useful classes of program invariants, including (i) nonlinear polynomial relations, which are fundamental to many scientific applications; disjunctive invariants, (ii) which express branching behaviors in programs; and (iii) properties about multidimensional arrays, which appear in many practical applications. We describe theoretical and empirical results showing that DIG can efficiently and accurately find many important invariants in real-world uses, e.g., polynomial properties in numerical algorithms and array relations in a full AES encryption implementation. Automatic program verification and synthesis are long-standing problems in computer science. However, there has been a lot of work on program verification and less so on program synthesis. Consequently, important synthesis tasks, e.g., generating program repairs, remain difficult and time-consuming. This dissertation proves that certain formulations of verification and synthesis are equivalent, allowing for direct applications of techniques and tools between these two research areas. Based on these ideas, we develop CETI, a tool that leverages existing verification techniques and tools for automatic program repair. Experimental results show that CETI can have higher success rates than many other standard program repair methods
Controllable and tolerable generalized eigenvectors of interval max-plus matrices
summary:By max-plus algebra we mean the set of reals equipped with the operations and for A vector is said to be a generalized eigenvector of max-plus matrices if for some . The investigation of properties of generalized eigenvectors is important for the applications. The values of vector or matrix inputs in practice are usually not exact numbers and they can be rather considered as values in some intervals. In this paper the properties of matrices and vectors with inexact (interval) entries are studied and complete solutions of the controllable, the tolerable and the strong generalized eigenproblem in max-plus algebra are presented. As a consequence of the obtained results, efficient algorithms for checking equivalent conditions are introduced
Q(sqrt(-3))-Integral Points on a Mordell Curve
We use an extension of quadratic Chabauty to number fields,recently developed by the author with Balakrishnan, Besser and M Ìuller,combined with a sieving technique, to determine the integral points overQ(ââ3) on the Mordell curve y2 = x3 â 4