Sciweavers

1228 search results - page 116 / 246
» Continuations, proofs and tests
Sort
View
BIRTHDAY
2010
Springer
15 years 10 months ago
The Arrow of Time through the Lens of Computing
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
Krishna V. Palem
CTRSA
2011
Springer
223views Cryptology» more  CTRSA 2011»
14 years 9 months ago
Expedient Non-malleability Notions for Hash Functions
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
Paul Baecher, Marc Fischlin, Dominique Schröd...
ICNP
2006
IEEE
16 years 15 hour ago
Rigorous Protocol Design in Practice: An Optical Packet-Switch MAC in HOL
— This paper reports on an experiment in network protocol design: we use novel rigorous techniques in the design process of a new protocol, in a close collaboration between syste...
Adam Biltcliffe, Michael Dales, Sam Jansen, Tom Ri...
195
Voted
KBSE
2000
IEEE
15 years 10 months ago
Model Checking Programs
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...
Willem Visser, Klaus Havelund, Guillaume P. Brat, ...
ASPDAC
2004
ACM
94views Hardware» more  ASPDAC 2004»
15 years 9 months ago
Improving simulation-based verification by means of formal methods
The design of complex systems is largely ruled by the time needed for verification. Even though formal methods can provide higher reliability, in practice often simulation based ve...
Görschwin Fey, Rolf Drechsler