14 citations · 24 across the 4 of their papers we have counts for
5 papers
Tight Verification of Probabilistic Robustness in Bayesian Neural Networks
Ben Batten, Mehran Hosseini, Alessio Lomuscio
We introduce two algorithms for computing tight guarantees on the probabilistic robustness of Bayesian Neural Networks (BNNs). Computing robustness guarantees for BNNs is a signifi…
Termination of Linear Loops over the Integers
Mehran Hosseini, Joël Ouaknine, James Worrell
We consider the problem of deciding termination of single-path while loops with integer variables, affine updates, and affine guard conditions. The question is whether such a loop…
Effective Divergence Analysis for Linear Recurrence Sequences
Shaull Almagor, Brynmor Chapman, Mehran Hosseini +2
We study the growth behaviour of rational linear recurrence sequences. We show that for low-order sequences, divergence is decidable in polynomial time. We also exhibit a polynomia…
Isomorphism classes of Doche-Icart-Kohel Curves over finite fields
Reza Rezaeian Farashahi, Mehran Hosseini
We give explicit formulas for the number of distinct elliptic curves over a finite field, up to isomorphism, in two families of curves introduced by C.~Doche, T.~Icart and D.~R. Ko…
On Termination of Integer Linear Loops
Joël Ouaknine, João Sousa Pinto, James Worrell
A fundamental problem in program verification concerns the termination of simple linear loops of the form x := u ; while Bx >= b do {x := Ax + a} where x is a vector of variables,…