923 search results - page 60 / 185 » Proving the value of formal methods |
171
click to vote
SAS
2010
Springer
15 years 4 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
235
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Several tools have been developed to explore and search Gene Ontology (GO) databases allowing efficient GO enrichment analysis and GO tree visualization. Nevertheless,...
162
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
act notation, so separating the abstract syntax and semantics of the language constructs from their different concrete notations. Although the foundation constituents of the MDE a...
184
click to vote
AMC
2011
15 years 1 months ago
2011
In this article we present the first results on domain decomposition methods for nonlocal operators. We present a nonlocal variational formulation for these operators and establi...
199
click to vote
CSFW
2005
IEEE
15 years 11 months ago
2005
IEEE
We develop a general method for proving properties of contract-signing protocols using a specialized protocol logic. The method is applied to the Asokan-ShoupWaidner and the Garay...