441 search results - page 12 / 89 » A Method for Proving Observational Equivalence |
CSFW
2012
IEEE
11 years 11 months ago
2012
IEEE
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...
UAI
2000
13 years 10 months ago
2000
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
SLOGICA
2010
13 years 3 months ago
2010
In this paper we present a sequent calculus for propositional dynamic logic built using an enriched version of the tree-hypersequent method and including an infinitary rule for the...
ICAL
2011
12 years 8 months ago
2011
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
ICFEM
2009
Springer
14 years 3 months ago
2009
Springer
Coinductive proofs of behavioral equivalence often require human ingenuity, in that one is expected to provide a “good” relation extending one’s goal with additional lemmas, ...