Sciweavers

1410 search results - page 240 / 282
» Proving theorems by reuse
Sort
View
ENTCS
2008
87views more  ENTCS 2008»
13 years 10 months ago
A Lightweight Approach for the Semantic Validation of Model Refinements
Model Driven Engineering proposes the use of models at different levels of ion. Step by step validation of model refinements is necessary to guarantee the correctness of the final ...
Claudia Pons, Diego García
ASE
2006
122views more  ASE 2006»
13 years 10 months ago
Combining Proof Plans with Partial Order Planning for Imperative Program Synthesis
The structured programming literature provides methods and a wealth of heuristic knowledge for guiding the construction of provably correct imperative programs. We investigate the...
Andrew Ireland, Jamie Stark
IANDC
2008
120views more  IANDC 2008»
13 years 10 months ago
A framework for compositional verification of security protocols
Automatic security protocol analysis is currently feasible only for small protocols. Since larger protocols quite often are composed of many small protocols, compositional analysi...
Suzana Andova, Cas J. F. Cremers, Kristian Gj&osla...
IANDC
2008
81views more  IANDC 2008»
13 years 10 months ago
Universal extensions to simulate specifications
A previous paper introduced eternity variables as an alternative to the prophecy variables of Abadi and Lamport and proved the formalism to be semantically complete: every simulat...
Wim H. Hesselink
ENTCS
2006
145views more  ENTCS 2006»
13 years 10 months ago
Real-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security Proof
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
Michael Backes