Sciweavers

4716 search results - page 452 / 944
» Iterative-free program analysis
Sort
View
IPPS
2010
IEEE
15 years 4 months ago
Executing task graphs using work-stealing
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha
ECLIPSE
2006
ACM
16 years 25 days ago
HAM: cross-cutting concerns in Eclipse
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 ...
Silvia Breu, Thomas Zimmermann, Christian Lindig
VSTTE
2005
Springer
16 years 10 days ago
Implications of a Data Structure Consistency Checking System
Abstract. We present a framework for verifying that programs correctly preserve important data structure consistency properties. Results from our implemented system indicate that o...
Viktor Kuncak, Patrick Lam, Karen Zee, Martin C. R...
CASES
2003
ACM
16 years 3 days ago
Clustered calculation of worst-case execution times
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...
Andreas Ermedahl, Friedhelm Stappert, Jakob Engblo...
ISSTA
2000
ACM
15 years 11 months ago
Which pointer analysis should I use?
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
Michael Hind, Anthony Pioli