6978 search results - page 249 / 1396 » On Proofs in System P |
172
click to vote
IANDC
2010
15 years 5 months ago
2010
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
176
click to vote
ECCC
2000
15 years 6 months ago
2000
Abstract. We present the first complete problem for SZK, the class of promise problems possessing statistical zero-knowledge proofs (against an honest verifier). The problem, calle...
135
click to vote
SAINT
2007
IEEE
16 years 27 days ago
2007
IEEE
—The “Gen2” specification for UHF passive RFID systems released by EPCglobal has become an intense research interest. A Gen2 tag derives its power from the RF wave emitted by...
189
click to vote
CAV
1998
Springer
15 years 11 months ago
1998
Springer
An implementation of an out-of-order processing unit based on Tomasulo's algorithm is formally verified using compositional model checking techniques. This demonstrates that f...
161
click to vote
CTCS
1997
Springer
15 years 10 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...