Sciweavers

357 search results - page 57 / 72
» Specifying and Verifying Fault-Tolerant Systems
Sort
View
FM
2003
Springer
109views Formal Methods» more  FM 2003»
14 years 26 days ago
Certifying and Synthesizing Membership Equational Proofs
As the systems we have to specify and verify become larger and more complex, there is a mounting need to combine different tools and decision procedures to accomplish large proof ...
Grigore Rosu, Steven Eker, Patrick Lincoln, Jos&ea...
GPCE
2009
Springer
14 years 8 days ago
A language and framework for invariant-driven transformations
This paper describes a language and framework that allow coordinated transformations driven by invariants to be specified declaratively, as invariant rules, and applied automatic...
Yanhong A. Liu, Michael Gorbovitski, Scott D. Stol...
PKC
1999
Springer
86views Cryptology» more  PKC 1999»
13 years 12 months ago
Preserving Privacy in Distributed Delegation with Fast Certificates
Abstract. In a distributed system, dynamically dividing execution between nodes is essential for service robustness. However, when all of the nodes cannot be equally trusted, and w...
Pekka Nikander, Yki Kortesniemi, Jonna Partanen
CSFW
2009
IEEE
13 years 11 months ago
Cryptographic Protocol Synthesis and Verification for Multiparty Sessions
We present the design and implementation of a compiler that, given high-level multiparty session descriptions, generates custom cryptographic protocols. Our sessions specify pre-a...
Karthikeyan Bhargavan, Ricardo Corin, Pierre-Malo ...
ECOWS
2006
Springer
13 years 11 months ago
Formal Modelling and Verification of an Asynchronous Extension of SOAP
Current web services are largely based on a synchronous request-response model that uses the Simple Object Access Protocol SOAP. Next-generation telecommunication networks, on the...
Maurice H. ter Beek, Stefania Gnesi, Franco Mazzan...