Figure - available via license: Creative Commons Attribution-ShareAlike 4.0 International
Content may be subject to copyright.
Performance metrics for four different domains from which the elements of í µí°´, í µí°µ, and í µí° ¶ are drawn from in the implementation for Freivalds' Algorithm. We only consider 2 × 2 matrices for each data type and use SomeOff to specify that í µí°´×µí°´× í µí°µ ≠ í µí° ¶. In each variant, Plinko explored 2 paths.
Source publication
We propose a symbolic execution method for programs that can draw random samples. In contrast to existing work, our method can verify randomized programs with unknown inputs and can prove probabilistic properties that universally quantify over all possible inputs. Our technique augments standard symbolic execution with a new class of \emph{probabil...
Context in source publication
Context 1
... each data type, we again restrict ourselves to 2 × 2 matrices and specify that í µí°´×µí°´× í µí°µ ≠ í µí° ¶ using the SomeOff encoding. The performance results are presented in Table 4. On the evaluating machine, long ints are eight bytes, ints are four bytes, short ints are two bytes, and chars are a single byte. ...