We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
Bhargav S. Gulavani, Thomas A. Henzinger, Yamini K...
Symbolic image computation is the most fundamental computation in BDD-based sequential system optimization and formal verification. In this paper, we explore the use of over-appr...
Service Oriented Architectures (SOAs) are constantly gaining ground for the provision of business to business as well as user-centric services, mainly in the form of Web Services ...
George N. Prezerakos, Nikolaos D. Tselikas, Giovan...