Sciweavers

293 search results - page 9 / 59
» Formal Security Analysis with Interacting State Machines
Sort
View
FMCAD
2007
Springer
13 years 11 months ago
A Mechanized Refinement Framework for Analysis of Custom Memories
We present a framework for formal verification of embedded custom memories. Memory verification is complicated ifficulty in abstracting design parameters induced by the inherently ...
Sandip Ray, Jayanta Bhadra
AGENTCL
2003
Springer
14 years 23 days ago
Nonmonotonic Commitment Machines
CHOPRA, AMIT KHUSHWANT. Nonmonotonic Commitment Machines. (Under the direction of Dr. Munindar P. Singh). Protocols in open and dynamic multiagent systems cannot be modeled via fo...
Amit K. Chopra, Munindar P. Singh
ESORICS
2005
Springer
14 years 1 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
ICTAC
2009
Springer
14 years 4 days ago
A Formal Approach to Heuristically Test Restorable Systems
Abstract. Given a nite state machine denoting the specication of a system, nding some short interaction sequences capable to reach some/all states or transitions of this machine...
Pablo Rabanal, Ismael Rodríguez, Fernando R...
CSFW
2010
IEEE
13 years 11 months ago
Strong Invariants for the Efficient Construction of Machine-Checked Protocol Security Proofs
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...
Simon Meier, Cas J. F. Cremers, David A. Basin