Sciweavers

641 search results - page 100 / 129
» Formal Reliability Analysis Using Theorem Proving
Sort
View
IJCNLP
2004
Springer
15 years 5 months ago
Statistical Substring Reduction in Linear Time
We study the problem of efficiently removing equal frequency n-gram substrings from an n-gram set, formally called Statistical Substring Reduction (SSR). SSR is a useful operatio...
Xueqiang Lü Le Zhang, Junfeng Hu
APIN
1998
98views more  APIN 1998»
14 years 11 months ago
The Evolution of Concurrent Programs
Process algebra are formal languages used for the rigorous specification and analysis of concurrent systems. By using a process algebra as the target language of a genetic program...
Brian J. Ross
INFOCOM
2005
IEEE
15 years 5 months ago
Exploiting heterogeneity in sensor networks
—The presence of heterogeneous nodes (i.e., nodes with an enhanced energy capacity or communication capability) in a sensor network is known to increase network reliability and l...
Mark D. Yarvis, Nandakishore Kushalnagar, Harkirat...
SP
2008
IEEE
132views Security Privacy» more  SP 2008»
14 years 10 months ago
Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...
Michael Backes, Matteo Maffei, Dominique Unruh
SAC
2009
ACM
15 years 6 months ago
A passive conformance testing approach for a MANET routing protocol
In this paper we propose a passive conformance testing technique applied to a Mobile ad hoc network (MANET) routing protocol, OLSR, that is characterized by a dynamically changing...
Ana R. Cavalli, Stéphane Maag, Edgardo Mont...