نتایج جستجو برای: Verified computation
تعداد نتایج: 210263 فیلتر نتایج به سال:
Because machine calculations are prone to errors that can sometimes accumulate disastrously, computer scientists use special strategies called verified computation to ensure output is reliable. Such strategies are needed for computing with probability distributions. In probabilistic calculations, analysts have routinely assumed (i) probabilities and probability distributions are precisely speci...
Poincaré maps often prove to be invaluable tools in the study of long-term behaviour and qualitative properties of a given dynamical system. While the analytic theory of these maps is fully explored, finding numerical algorithms that allow the computation of Poincaré maps in concrete problems is far from trivial. For the verification it is desirable to approximate the Poincaré map over as large...
Formal verification of the security of software systems is gradually moving from the traditional focus on idealized models, to the more ambitious goal of producing verified implementations. This trend is also present in recent work targeting the verification of cryptographic software, but the reach of existing tools has so far been limited to cryptographic primitives, such as RSA-OAEP encryptio...
After the introduction basic properties of interval arithmetic are discussed and different approaches are repeated by which one can compute verified numerical approximations for a solution of a nonlinear equation.
We present a compiler that automates the task of converting high-level code to constraint sets of the form accepted by the Ginger and Zaatar protocols for verified computation. Performing the conversion from high-level code to constraints by hand is prone to human error and therefore not practical for large computations. This paper evaluates the performance of the compiler and the effectiveness...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید