Sciweavers

2050 search results - page 377 / 410
» A formal foundation for process modeling
Sort
View
HASKELL
2009
ACM
15 years 8 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
COGSCI
2004
148views more  COGSCI 2004»
15 years 1 months ago
Disfluencies, language comprehension, and Tree Adjoining Grammars
Disfluencies include editing terms such as uh and um as well as repeats and revisions. Little is known about how disfluencies are processed, and there has been next to no research...
Fernanda Ferreira, Ellen F. Lau, Karl G. D. Bailey
CSFW
2012
IEEE
13 years 4 months ago
Provably Secure and Practical Onion Routing
The onion routing network Tor is undoubtedly the most widely employed technology for anonymous web access. Although the underlying onion routing (OR) protocol appears satisfactory...
Michael Backes, Ian Goldberg, Aniket Kate, Esfandi...
WWW
2008
ACM
16 years 2 months ago
Organizing the unorganized - employing IT to empower the under-privileged
Various sectors in developing countries are typically dominated by the presence of a large number of small and microbusinesses that operate in an informal, unorganized manner. Man...
Arun Kumar, Nitendra Rajput, Sheetal K. Agarwal, D...
CCS
2009
ACM
16 years 2 months ago
Conditional proxy re-encryption secure against chosen-ciphertext attack
In a proxy re-encryption (PRE) scheme [4], a proxy, authorized by Alice, transforms messages encrypted under Alice's public key into encryptions under Bob's public key w...
Jian Weng, Robert H. Deng, Xuhua Ding, Cheng-Kang ...