Sciweavers

990 search results - page 59 / 198
» A Static Analysis Technique for Graph Transformation Systems
Sort
View
FOSSACS
2006
Springer
14 years 20 days ago
Register Allocation After Classical SSA Elimination is NP-Complete
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
Fernando Magno Quintão Pereira, Jens Palsbe...
JEC
2006
61views more  JEC 2006»
13 years 9 months ago
Time-constrained loop scheduling with minimal resources
Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
AOSD
2008
ACM
13 years 11 months ago
AJANA: a general framework for source-code-level interprocedural dataflow analysis of AspectJ software
Aspect-oriented software presents new challenges for the designers of static analyses. Our work aims to establish systematic foundations for dataflow analysis of AspectJ software....
Guoqing Xu, Atanas Rountev
ISMAR
2006
IEEE
14 years 3 months ago
Spatial relationship patterns: elements of reusable tracking and calibration systems
With tracking setups becoming increasingly complex, it gets more difficult to find suitable algorithms for tracking, calibration and sensor fusion. A large number of solutions e...
Daniel Pustka, Martin Huber, Manuel Bauer, Gudrun ...
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
14 years 1 months ago
H2 performance of agreement protocol with noise: An edge based approach
— This work presents an H2 performance analysis of the agreement protocol in the presence of noise. The agreement protocol is first transformed into an equivalent system induced...
Daniel Zelazo, Mehran Mesbahi