151 search results - page 9 / 31 » Efficient regular expression evaluation: theory to practice |
106
click to vote
USS
2010
2010
P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users
14 years 7 months ago
In this paper we introduce a framework for privacypreserving distributed computation that is practical for many real-world applications. The framework is called Peers for Privacy ...
69
Voted
JELIA
1990
Springer
15 years 1 months ago
1990
Springer
In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions ...
EDBT
2006
ACM
15 years 9 months ago
2006
ACM
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for...
CHI
2008
ACM
14 years 11 months ago
2008
ACM
Usability evaluation methods have a long history of research. Latest contributions significantly raised the validity of method evaluation studies. But there is still a measurement...
ASE
2010
14 years 9 months ago
2010
Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs. Howev...