641 search results - page 57 / 129 » Formal Reliability Analysis Using Theorem Proving |
SAS
2007
Springer
14 years 3 months ago
2007
Springer
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
IFIP
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We formally study two privacy-type properties in online auction protocols, bidding-price-secrecy and receipt-freeness. These properties are formalised as observational eq...
EUROCRYPT
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We present a formalism for the analysis of key-exchange protocols that combines previous definitional approaches and results in a definition of security that enjoys som...
CADE
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
PPOPP
2010
ACM
14 years 6 months ago
2010
ACM
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...