7785 search results - page 1522 / 1557 » The Concept of Dynamic Analysis |
130
click to vote
PLDI
2003
ACM
15 years 6 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
137
click to vote
SIGMETRICS
2003
ACM
15 years 6 months ago
2003
ACM
In this paper we present a general hybrid systems modeling framework to describe the flow of traffic in communication networks. To characterize network behavior, these models use...
109
click to vote
SPAA
2003
ACM
15 years 6 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
WPES
2003
ACM
15 years 6 months ago
2003
ACM
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
150
click to vote
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...