Sciweavers

792 search results - page 125 / 159
» Static Analysis of XSLT Programs
Sort
View
IEEEPACT
2005
IEEE
14 years 2 months ago
Communication Optimizations for Fine-Grained UPC Applications
Global address space languages like UPC exhibit high performance and portability on a broad class of shared and distributed memory parallel architectures. The most scalable applic...
Wei-Yu Chen, Costin Iancu, Katherine A. Yelick
HIPC
2007
Springer
14 years 11 days ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
ENTCS
2007
100views more  ENTCS 2007»
13 years 8 months ago
Using Template Haskell for Abstract Interpretation
mplate Haskell for Abstract Interpretation Clara Segura1 ,2 Departamento de Sistemas Inform´aticos y Programaci´on Universidad Complutense de Madrid Madrid, Spain Carmen Torrano3...
Clara Segura, Carmen Torrano
TAPSOFT
1995
Springer
14 years 1 days ago
Comparing Flow-Based Binding-Time Analyses
Abstract. Binding-time analyses based on flow analysis have been presented by Bondorf, Consel, Bondorf and Jørgensen, and Schwartzbach and the present author. The analyses are fo...
Jens Palsberg
ECLIPSE
2006
ACM
14 years 2 months 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