Sciweavers

10568 search results - page 56 / 2114
» Computer Intelligence and Formalization
Sort
View
DAC
2009
ACM
15 years 10 months ago
Computing bounds for fault tolerance using formal techniques
Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g. due to environmental radiation. Approaches to implement fault tol...
André Sülflow, Görschwin Fey, Rol...
ASIAN
2006
Springer
134views Algorithms» more  ASIAN 2006»
15 years 1 months ago
Computational Soundness of Formal Indistinguishability and Static Equivalence
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
Gergei Bana, Payman Mohassel, Till Stegers
GC
2004
Springer
15 years 3 months ago
Towards a Formal Treatment of Secrecy Against Computational Adversaries
Polynomial time adversaries based on a computational view of cryptography have additional capabilities that the classical Dolev-Yao adversary model does not include. To relate thes...
Angelo Troina, Alessandro Aldini, Roberto Gorrieri
PPAM
2007
Springer
15 years 3 months ago
A Formal Model of Multi-agent Computations
Abstract. The paper contains an extension of a formal model of multiagent computing system developed in previous publications towards considering a more general system state. We pr...
Maciej Smolka
IFIP
2004
Springer
15 years 3 months ago
Complementing Computational Protocol Analysis with Formal Specifications
Abstract The computational proof model of Bellare and Rogaway for cryptographic protocol analysis is complemented by providing a formal specification of the actions of the adversa...
Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchco...