1612 search results - page 293 / 323 » Analysing Randomized Distributed Algorithms |
ECLIPSE
2006
ACM
14 years 1 months ago
2006
ACM
As programs evolve, newly added functionality sometimes no longer aligns with the original design, ending up scattered across the software system. Aspect mining tries to identify ...
DAC
1997
ACM
13 years 11 months ago
1997
ACM
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
SP
1989
IEEE
13 years 11 months ago
1989
IEEE
Routing mechanisms for inter-autonomousregion communication require distribution of policy-sensitive information as well as algorithms that operate on such information. Without su...
CODES
2007
IEEE
13 years 11 months ago
2007
IEEE
For the worst-case execution time (WCET) analysis, especially loops are an inherent source of unpredictability and loss of precision. This is caused by the difficulty to obtain sa...
ICSE
2010
IEEE-ACM
13 years 9 months ago
2010
IEEE-ACM
Typestate analysis determines whether a program violates a set of finite-state properties. Because the typestate-analysis problem is statically undecidable, researchers have propo...