Sciweavers

1757 search results - page 332 / 352
» Integrating and Extending JCSP
Sort
View
CIKM
1993
Springer
15 years 1 months ago
Collection Oriented Match
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
Anurag Acharya, Milind Tambe
LPNMR
1990
Springer
15 years 1 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
AOSD
2007
ACM
15 years 1 months ago
SCoPE: an AspectJ compiler for supporting user-defined analysis-based pointcuts
This paper proposes an approach called SCoPE, which supports user-defined analysis-based pointcuts in aspect-oriented programming (AOP) languages. The advantage of our approach is...
Tomoyuki Aotani, Hidehiko Masuhara
EXPCS
2007
15 years 1 months ago
The user in experimental computer systems research
Experimental computer systems research typically ignores the end-user, modeling him, if at all, in overly simple ways. We argue that this (1) results in inadequate performance eva...
Peter A. Dinda, Gokhan Memik, Robert P. Dick, Bin ...
ACNS
2004
Springer
85views Cryptology» more  ACNS 2004»
15 years 1 months ago
CamouflageFS: Increasing the Effective Key Length in Cryptographic Filesystems on the Cheap
One of the few quantitative metrics used to evaluate the security of a cryptographic file system is the key length of the encryption algorithm; larger key lengths correspond to hig...
Michael E. Locasto, Angelos D. Keromytis