Sciweavers

1251 search results - page 234 / 251
» Optimizing Compilation of CLP(R)
Sort
View
ESOP
2010
Springer
14 years 4 months ago
Parameterized Memory Models and Concurrent Separation Logic
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
Rodrigo Ferreira, Xinyu Feng and Zhong Shao
EUROSYS
2007
ACM
14 years 4 months ago
Competitive prefetching for concurrent sequential I/O
During concurrent I/O workloads, sequential access to one I/O stream can be interrupted by accesses to other streams in the system. Frequent switching between multiple sequential ...
Chuanpeng Li, Kai Shen, Athanasios E. Papathanasio...
ACNS
2009
Springer
142views Cryptology» more  ACNS 2009»
14 years 2 months ago
Group Key Exchange Enabling On-Demand Derivation of Peer-to-Peer Keys
We enrich the classical notion of group key exchange (GKE) protocols by a new property that allows each pair of users to derive an independent peer-to-peer (p2p) key on-demand and ...
Mark Manulis
CASES
2006
ACM
14 years 1 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
EMSOFT
2005
Springer
14 years 27 days ago
High performance annotation-aware JVM for Java cards
Early applications of smart cards have focused in the area of personal security. Recently, there has been an increasing demand for networked, multi-application cards. In this new ...
Ana Azevedo, Arun Kejariwal, Alexander V. Veidenba...