8132 search results - page 368 / 1627 » Dependability, Abstraction, and Programming |
175
click to vote
MIDDLEWARE
2005
Springer
16 years 10 days ago
2005
Springer
A problem with many distributed applications is their behavior in lieu of unpredictable variations in user request volumes or in available resources. This paper explores a performa...
155
click to vote
PET
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Low-latency anonymous communication networks require padding to resist timing analysis attacks, and dependent link padding has been proven to prevent these attacks with m...
169
click to vote
ESA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
248
click to vote
POPL
2000
ACM
15 years 11 months ago
2000
ACM
We propose an automatic method to enforce trace properties on programs. The programmer specifies the property separately from the program; a program transformer takes the program...
280
click to vote
POPL
2005
ACM
16 years 7 months ago
2005
ACM
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap locations of global reasoning about entire heap abstractions. We present an int...