Sciweavers

819 search results - page 20 / 164
» Using Assumptions to Distribute CTL Model Checking
Sort
View
FORTE
2010
15 years 1 months ago
On Efficient Models for Model Checking Message-Passing Distributed Protocols
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...
Péter Bokor, Marco Serafini, Neeraj Suri
94
Voted
AAAI
2004
15 years 1 months ago
Model Checking Temporal Logics of Knowledge in Distributed Systems
Model checking is a promising approach to automatic verification, which has concentrated on specification expressed in temporal logic. Comparatively little attention has been give...
Kaile Su
TYPES
2004
Springer
15 years 5 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
ESORICS
2005
Springer
15 years 6 months ago
Machine-Checked Security Proofs of Cryptographic Signature Schemes
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
Sabrina Tarento
110
Voted
CAV
2009
Springer
116views Hardware» more  CAV 2009»
15 years 5 months ago
Priority Scheduling of Distributed Systems Based on Model Checking
Priorities are used to control the execution of systems to meet given requirements for optimal use of resources, e.g., by using scheduling policies. For distributed systems, it is ...
Ananda Basu, Saddek Bensalem, Doron Peled, Joseph ...