Sciweavers

641 search results - page 103 / 129
» Formal Reliability Analysis Using Theorem Proving
Sort
View
ICSM
2009
IEEE
14 years 3 months ago
A theoretical and empirical study of EFSM dependence
Dependence analysis underpins many activities in software maintenance such as comprehension and impact analysis. As a result, dependence has been studied widely for programming la...
Kelly Androutsopoulos, Nicolas Gold, Mark Harman, ...
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
14 years 28 days ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
ECCV
2006
Springer
14 years 10 months ago
Iterative Extensions of the Sturm/Triggs Algorithm: Convergence and Nonconvergence
We give the first complete theoretical convergence analysis for the iterative extensions of the Sturm/Triggs algorithm. We show that the simplest extension, SIESTA, converges to no...
John Oliensis, Richard Hartley
CCGRID
2006
IEEE
14 years 2 months ago
GRENCHMARK: A Framework for Analyzing, Testing, and Comparing Grids
Grid computing is becoming the natural way to aggregate and share large sets of heterogeneous resources. With the infrastructure becoming ready for the challenge, current grid dev...
Alexandru Iosup, Dick H. J. Epema
ICFP
2009
ACM
14 years 9 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...