Sciweavers

3134 search results - page 265 / 627
» Computing full disjunctions
Sort
View
140
Voted
EUROSYS
2006
ACM
16 years 14 days ago
Solving the starting problem: device drivers as self-describing artifacts
Run-time conflicts can affect even the most rigorously tested software systems. A reliance on execution-based testing makes it prohibitively costly to test every possible interac...
Michael F. Spear, Tom Roeder, Orion Hodson, Galen ...
120
Voted
LICS
2009
IEEE
15 years 10 months ago
Ludics with Repetitions (Exponentials, Interactive Types and Completeness)
Abstract. Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies ...
Michele Basaldella, Claudia Faggian
120
Voted
ASIACRYPT
2007
Springer
15 years 9 months ago
Blind Identity-Based Encryption and Simulatable Oblivious Transfer
An extended abstract of this paper appears in Kaoru Kurosawa (Ed.): Advances in Cryptology ASIACRYPT 2007, volume 4833 of Lecture Notes in Computer Science, pages 265–282, Spring...
Matthew Green, Susan Hohenberger
SENSYS
2006
ACM
15 years 9 months ago
Run-time dynamic linking for reprogramming wireless sensor networks
From experience with wireless sensor networks it has become apparent that dynamic reprogramming of the sensor nodes is a useful feature. The resource constraints in terms of energ...
Adam Dunkels, Niclas Finne, Joakim Eriksson, Thiem...
SIGMETRICS
2006
ACM
104views Hardware» more  SIGMETRICS 2006»
15 years 9 months ago
Modeling adoptability of secure BGP protocols
Despite the existence of several secure BGP routing protocols, there has been little progress to date on actual adoption. Although feasibility for widespread adoption remains the ...
Haowen Chan, Debabrata Dash, Adrian Perrig, Hui Zh...