Programming Languages and Systems

From MaRDI portal
Publication:5308685


DOI10.1007/b96702zbMath1126.68353OpenAlexW2964738244MaRDI QIDQ5308685

Antoine Miné

Publication date: 28 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b96702



Related Items

The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory, Compact Difference Bound Matrices, Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness, Why does Astrée scale up?, Exploiting verified neural networks via floating point numerical error, Termination of floating-point computations, The octagon abstract domain, Correct approximation of IEEE 754 floating-point arithmetic for program verification, When Is a Formula a Loop Invariant?, Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case, The analytic hierarchy process, max algebra and multi-objective optimisation, Acceleration of the abstract fixpoint computation in numerical program analysis, Discovering invariants via simple component analysis, Deciding floating-point logic with abstract conflict driven clause learning, Linear Absolute Value Relation Analysis, Formal analysis of the compact position reporting algorithm, Checking Compatibility of Bit Sizes in Floating Point Comparison Operations, Approximating the volume of tropical polytopes is difficult, A formally verified floating-point implementation of the compact position reporting algorithm, Mutation-Based Test Case Generation for Simulink Models, Static Contract Checking with Abstract Interpretation, Static Analysis of Finite Precision Computations, Optimal inverse projection of floating-point addition, Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships, Polynomial Precise Interval Analysis Revisited, Incrementally closing octagons


Uses Software