1410 search results - page 215 / 282 » Proving theorems by reuse |
SAC
2010
ACM
13 years 8 months ago
2010
ACM
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
SP
2010
IEEE
13 years 7 months ago
2010
IEEE
The security of systems such as operating systems, hypervisors, and web browsers depend critically on reference monitors to correctly enforce their desired security policy in the ...
FAC
2010
13 years 7 months ago
2010
Data refinement is a common approach to reasoning about programs, based on establishing that te program indeed satisfies all the required properties imposed by an intended abstract...
FSE
2011
Springer
13 years 1 months ago
2011
Springer
Abstract. Bellare and Kohno introduced a formal framework for the study of related-key attacks against blockciphers. They established sufficient conditions (output-unpredictabilit...
NETWORKS
2011
13 years 26 days ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...