Sciweavers

1796 search results - page 148 / 360
» An Approach to Compositional Model Checking
Sort
View
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
14 years 3 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
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) ...
Daniel Lewin, Salil P. Vadhan
ICFEM
2007
Springer
14 years 2 months ago
Automating Refinement Checking in Probabilistic System Design
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...
Carlos Gonzalia, Annabelle McIver
SIGSOFT
2006
ACM
14 years 11 months ago
SYNERGY: a new algorithm for property checking
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...
ICCAD
2003
IEEE
148views Hardware» more  ICCAD 2003»
14 years 7 months ago
The Compositional Far Side of Image Computation
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...
Chao Wang, Gary D. Hachtel, Fabio Somenzi
ICWS
2007
IEEE
14 years 6 days ago
Model-driven Composition of Context-aware Web Services Using ContextUML and Aspects
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...