Sciweavers

4276 search results - page 377 / 856
» Techniques for Empirical Validation
Sort
View
ASPDAC
2007
ACM
139views Hardware» more  ASPDAC 2007»
15 years 11 months ago
Deeper Bound in BMC by Combining Constant Propagation and Abstraction
ound in BMC by Combining Constant Propagation and Abstraction Roy Armoni, Limor Fix1 , Ranan Fraer1 , Tamir Heyman1,3 , Moshe Vardi2 , Yakir Vizel1 , Yael Zbar1 1 Logic and Validat...
Roy Armoni, Limor Fix, Ranan Fraer, Tamir Heyman, ...
CN
2008
126views more  CN 2008»
15 years 7 months ago
Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...
Pallab Datta, Arun K. Somani
CORR
2006
Springer
95views Education» more  CORR 2006»
15 years 6 months ago
Peer-to-Peer Communication Across Network Address Translators
Network Address Translation (NAT) causes well-known difficulties for peer-to-peer (P2P) communication, since the peers involved may not be reachable at any globally valid IP addre...
Bryan Ford, Pyda Srisuresh, Dan Kegel
INFSOF
2007
104views more  INFSOF 2007»
15 years 6 months ago
A state-based approach to integration testing based on UML models
: Correct functioning of object-oriented software depends upon the successful integration of classes. While individual classes may function correctly, several new faults can arise ...
Shaukat Ali, Lionel C. Briand, Muhammad Jaffar-Ur ...
JCST
2010
189views more  JCST 2010»
15 years 1 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar