256 search results - page 23 / 52 » Approximation of the worst-case execution time using structu... |
108
click to vote
ATAL
2010
Springer
15 years 26 days ago
2010
Springer
Robotic swarms, like all spatial computers, are a challenging environment for the execution of distributed consensus algorithms due to their scale, diameter, and frequent failures...
113
click to vote
STACS
2007
Springer
15 years 5 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
106
click to vote
APLAS
2005
ACM
15 years 5 months ago
2005
ACM
Many problems in program analysis can be expressed naturally and concisely in a declarative language like Datalog. This makes it easy to specify new analyses or extend or compose e...
123
click to vote
IEEEINTERACT
2003
IEEE
15 years 5 months ago
2003
IEEE
Recent studies on program execution behavior reveal that a large amount of execution time is spent in small frequently executed regions of code. Whereas adaptive cache management ...
106
click to vote
ISSTA
2009
ACM
15 years 6 months ago
2009
ACM
Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch stateme...