Sciweavers

531 search results - page 17 / 107
» Formal Methods for Networks on Chips
Sort
View
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
15 years 3 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
FM
2006
Springer
124views Formal Methods» more  FM 2006»
15 years 1 months ago
Compositional Binding in Network Domains
This paper considers network services that bind identifiers in the course of delivering messages, and also persistent, point-to-point connections made in the context of such bindin...
Pamela Zave
70
Voted
ASPDAC
2005
ACM
90views Hardware» more  ASPDAC 2005»
14 years 11 months ago
Feasibility analysis of messages for on-chip networks using wormhole routing
—The feasibility of a message in a network concerns if its timing property can be satisfied without jeopardizing any messages already in the network to meet their timing propert...
Zhonghai Lu, Axel Jantsch, Ingo Sander
JOT
2006
64views more  JOT 2006»
14 years 9 months ago
Game Development Using Design-by-Contract
There are some application domains to which it appears intrinsically challenging to introduce the services offered by formal engineering methods. This paper is an evidence-based p...
Richard F. Paige, Triston S. Attridge, Phillip J. ...
CCS
2008
ACM
14 years 11 months ago
Formal analysis of SAML 2.0 web browser single sign-on: breaking the SAML-based single sign-on for google apps
Single-Sign-On (SSO) protocols enable companies to establish a federated environment in which clients sign in the system once and yet are able to access to services offered by dif...
Alessandro Armando, Roberto Carbone, Luca Compagna...