Sciweavers

900 search results - page 11 / 180
» On the observational theory of the CPS-calculus
Sort
View
CSFW
2009
IEEE
14 years 3 months ago
A Method for Proving Observational Equivalence
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...
Véronique Cortier, Stéphanie Delaune
UAI
2003
13 years 10 months ago
Updating with incomplete observations
Currently, there is renewed interest in the problem, raised by Shafer in 1985, of updating probabilities when observations are incomplete (or setvalued). This is a fundamental pro...
Gert de Cooman, Marco Zaffalon
ICFP
2008
ACM
14 years 9 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
ICMCS
2006
IEEE
167views Multimedia» more  ICMCS 2006»
14 years 3 months ago
Efficient Object Tracking using Control-Based Observer Design
Kernel-based tracking approaches have proven to be more efficient in computation compared to other tracking approaches such as particle filtering. However, existing kernel-based...
Wei Qu, Dan Schonfeld
ATAL
2010
Springer
13 years 10 months ago
Risk-sensitive planning in partially observable environments
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
Janusz Marecki, Pradeep Varakantham