Sciweavers

2947 search results - page 394 / 590
» Analyzing Program Analyses
Sort
View
NIPS
1996
15 years 3 months ago
Predicting Lifetimes in Dynamically Allocated Memory
Predictions oflifetimesofdynamicallyallocated objects can be used to improve time and space e ciency of dynamic memory management in computer programs. Barrett and Zorn 1993] used...
David A. Cohn, Satinder P. Singh
117
Voted
BMCBI
2010
126views more  BMCBI 2010»
15 years 2 months ago
Cgaln: fast and space-efficient whole-genome alignment
Background: Whole-genome sequence alignment is an essential process for extracting valuable information about the functions, evolution, and peculiarities of genomes under investig...
Ryuichiro Nakato, Osamu Gotoh
DC
2010
15 years 2 months ago
Model checking transactional memories
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh
125
Voted
BMCBI
2005
137views more  BMCBI 2005»
15 years 2 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,...
162
Voted
ENTCS
2002
134views more  ENTCS 2002»
15 years 2 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