Sciweavers

6960 search results - page 345 / 1392
» Continuity Analysis of Programs
Sort
View
NHM
2010
87views more  NHM 2010»
14 years 11 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
168
Voted
APLAS
2009
ACM
15 years 11 months ago
Scalable Context-Sensitive Points-to Analysis Using Multi-dimensional Bloom Filters
Abstract. Context-sensitive points-to analysis is critical for several program optimizations. However, as the number of contexts grows exponentially, storage requirements for the a...
Rupesh Nasre, Kaushik Rajan, Ramaswamy Govindaraja...
BMCBI
2005
137views more  BMCBI 2005»
15 years 4 months ago
ArrayQuest: a web resource for the analysis of DNA microarray data
Background: Numerous microarray analysis programs have been created through the efforts of Open Source software development projects. Providing browser-based interfaces that allow...
Gary L. Argraves, Saurin D. Jani, Jeremy L. Barth,...
125
Voted
IWMM
2007
Springer
116views Hardware» more  IWMM 2007»
15 years 10 months ago
Heap space analysis for java bytecode
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
ENTCS
2002
134views more  ENTCS 2002»
15 years 4 months ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells