Sciweavers

923 search results - page 2 / 185
» Proving the value of formal methods
Sort
View
CADE
2008
Springer
14 years 5 months ago
Proving Bounds on Real-Valued Functions with Computations
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
Guillaume Melquiond
CAV
2004
Springer
89views Hardware» more  CAV 2004»
13 years 10 months ago
Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement
Thomas Ball, Byron Cook, Shuvendu K. Lahiri, Linta...
JCST
2010
189views more  JCST 2010»
13 years 5 days 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
FM
2003
Springer
104views Formal Methods» more  FM 2003»
13 years 10 months ago
Proving the Shalls
Incomplete, inaccurate, ambiguous, and volatile requirements have plagued the software industry since its inception. The convergence of model-based development and formal methods o...
Steven P. Miller, Alan C. Tribble, Mats Per Erik H...
FM
1999
Springer
161views Formal Methods» more  FM 1999»
13 years 9 months ago
Combining Theorem Proving and Continuous Models in Synchronous Design
Support for system speci cation in terms of modelling and simulation environments has become a common practice in safety-critical applications. Also, a current trend is the automat...
Simin Nadjm-Tehrani, Ove Åkerlund