Sciweavers

1322 search results - page 225 / 265
» Unsound Theorem Proving
Sort
View
IUI
2003
ACM
14 years 2 months ago
Inferring user goals from personality and behavior in a causal model of user affect
We present a probabilistic model, based on Dynamic Decision Networks, to assess user affect from possible causes of emotional arousal. The model relies on the OCC cognitive theory...
Xiaoming Zhou, Cristina Conati
FSTTCS
2003
Springer
14 years 2 months ago
A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol
We prove the Needham-Schroeder-Lowe public-key protocol secure under real, active cryptographic attacks including concurrent protocol runs. This proof is based on an abstract crypt...
Michael Backes, Birgit Pfitzmann
INFOCOM
2002
IEEE
14 years 1 months ago
On the capacity of wireless networks: The relay case
Abstract— In [1], Gupta and Kumar determined the capacity of wireless networks under certain assumptions, among them point-to-point coding, which excludes for example multi-acces...
Michael Gastpar, Martin Vetterli
FM
2009
Springer
163views Formal Methods» more  FM 2009»
14 years 1 months ago
Analysis of a Clock Synchronization Protocol for Wireless Sensor Networks
We study a clock synchronization protocol for the Chess WSN. First, we model the protocol as a network of timed automata and verify various instances using the Uppaal model checker...
Faranak Heidarian, Julien Schmaltz, Frits W. Vaand...
CAV
2001
Springer
119views Hardware» more  CAV 2001»
14 years 1 months ago
Certifying Model Checkers
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
Kedar S. Namjoshi