Sciweavers

167 search results - page 6 / 34
» Comparing Two Notions of Simulatability
Sort
View
93
Voted
LICS
2008
IEEE
15 years 5 months ago
Reachability Games and Game Semantics: Comparing Nondeterministic Programs
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
Andrzej S. Murawski
CORR
2002
Springer
85views Education» more  CORR 2002»
14 years 11 months ago
The partition semantics of questions, syntactically
Groenendijk and Stokhof (1984, 1996; Groenendijk 1999) provide a logically attractive theory of the semantics of natural language questions, commonly referred to as the partition t...
Chung-chieh Shan, Balder ten Cate
EUROCRYPT
2005
Springer
15 years 4 months ago
Smooth Projective Hashing and Two-Message Oblivious Transfer
We present a general framework for constructing two-message oblivious transfer protocols using a modification of Cramer and Shoup’s notion of smooth projective hashing (2002). ...
Yael Tauman Kalai
CONCUR
2010
Springer
15 years 7 days ago
Generic Forward and Backward Simulations II: Probabilistic Simulation
Jonsson and Larsen's notion of probabilistic simulation is studied from a coalgebraic perspective. The notion is compared with two generic coalgebraic definitions of simulatio...
Ichiro Hasuo
TARK
2005
Springer
15 years 4 months ago
Interactive unawareness revisited
We analyze a model of interactive unawareness introduced by Heifetz, Meier and Schipper (HMS). We consider two axiomatizations for their model, which capture different notions of ...
Joseph Y. Halpern, Leandro Chaves Rêgo