4305 search results - page 276 / 861 » Analysing Protocol Implementations |
130
click to vote
SIGCOMM
2010
ACM
15 years 2 months ago
2010
ACM
Building distributed applications for data centers is hard. CamCube explores whether replacing the traditional switchbased network with a directly connected topology makes it easi...
92
Voted
ICSE
2009
IEEE-ACM
16 years 3 months ago
2009
IEEE-ACM
We present an effective static deadlock detection algorithm for Java. Our algorithm uses a novel combination of static analyses each of which approximates a different necessary co...
104
click to vote
CADE
2008
Springer
16 years 2 months ago
2008
Springer
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...
106
click to vote
IFIP
2009
Springer
15 years 9 months ago
2009
Springer
We firstly describe an algebraic structure which serves as solid basis to quantitatively reason about information flows. We demonstrate how programs in form of partition of state...
127
Voted
LOPSTR
2009
Springer
15 years 9 months ago
2009
Springer
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...