1716 search results - page 194 / 344 » Proving Conditional Termination |
123
click to vote
JCS
2010
15 years 1 months ago
2010
Protocol authentication properties are generally trace-based, meaning that authentication holds for the protocol if authentication holds for individual traces (runs of the protoco...
126
click to vote
TIT
2008
15 years 1 months ago
2008
The performance of punctured LDPC codes under maximum-likelihood (ML) decoding is studied in this paper via deriving and analyzing their average weight distributions (AWDs) and th...
156
click to vote
LATA
2010
Springer
15 years 1 months ago
2010
Springer
We apply language theory to compare the expressive power of models that extend Petri nets with features like colored tokens and/or whole place operations. Specifically, we conside...
125
click to vote
LICS
2010
IEEE
15 years 1 months ago
2010
IEEE
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
132
click to vote
MLQ
2010
15 years 1 months ago
2010
: It is well known that, in a topological space, the open sets can be characterized using filter convergence. In ZF (Zermelo-Fraenkel set theory without the Axiom of Choice), we c...