256 search results - page 11 / 52 » Noetherian Spaces in Verification |
ENTCS
2010
14 years 7 months ago
2010
Testing and verification of asynchronously communicating objects in open environments are challenging due to non-determinism. We explore a formal approach for black-box testing by...
ENTCS
2008
14 years 9 months ago
2008
Verification of multi-threaded C++ programs poses three major challenges: the large number of states, states with huge sizes, and time intensive expansions of states. This paper p...
KBSE
1998
IEEE
15 years 1 months ago
1998
IEEE
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical comm...
ICCAD
2006
IEEE
15 years 6 months ago
2006
IEEE
– Identifying worst-case voltage drop conditions in every module supplied by the power grid is a crucial problem in modern IC design. In this paper we develop a novel methodology...
DSN
2007
IEEE
15 years 1 months ago
2007
IEEE
Model-checking of asynchronous distributed protocols is challenging because of the large size of the state and solution spaces. This paper tackles this problem in the context of l...