A generalization of \(p\)-boxes to affine arithmetic
From MaRDI portal
Publication:411436
DOI10.1007/s00607-011-0182-8zbMath1247.60006OpenAlexW2104044130MaRDI QIDQ411436
Jean Goubault-Larrecq, Olivier Bouissou, Eric Goubault, Sylvie Putot
Publication date: 4 April 2012
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-011-0182-8
Related Items
Rigorous roundoff error analysis of probabilistic floating-point computations ⋮ Floating-point arithmetic on the test bench. How are verified numerical solutions calculated? ⋮ Pari-mutuel probabilities as an uncertainty model ⋮ Mathematically rigorous global optimization in floating-point arithmetic ⋮ A zonotopic framework for functional abstractions ⋮ Quantitative static analysis of communication protocols using abstract Markov chains
Uses Software
Cites Work
- Equivalence of methods for uncertainty propagation of real-valued random variables
- Probabilistic arithmetic. I: Numerical methods for calculating convolutions and dependency bounds
- Best-possible bounds for the distribution of a sum -- a problem of Kolmogorov
- An introduction to copulas. Properties and applications
- Bounding the results of arithmetic operations on random variables of unknown dependency using intervals
- Static Analysis of Finite Precision Computations
- A zonotopic framework for functional abstractions
- Unnamed Item
- Unnamed Item
- Unnamed Item