Sciweavers

2514 search results - page 10 / 503
» The use of industrial-strength formal methods
Sort
View
JCST
2010
189views more  JCST 2010»
14 years 6 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
FMCAD
2009
Springer
15 years 6 months ago
Protocol verification using flows: An industrial experience
John W. O'Leary, Murali Talupur, Mark R. Tuttle
FMCAD
2006
Springer
15 years 3 months ago
Reducing Verification Complexity of a Multicore Coherence Protocol Using Assume/Guarantee
Xiaofang Chen, Yu Yang, Ganesh Gopalakrishnan, Chi...