Sciweavers

1452 search results - page 138 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
201
Voted
POPL
2003
ACM
16 years 27 days ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta
104
Voted
ECOOP
2004
Springer
15 years 6 months ago
Demand-Driven Type Inference with Subgoal Pruning: Trading Precision for Scalability
After two decades of effort, type inference for dynamically typed languages scales to programs of a few tens of thousands of lines of code, but no further. For larger programs, th...
S. Alexander Spoon, Olin Shivers
ICSE
2012
IEEE-ACM
13 years 3 months ago
Synthesizing API usage examples
Abstract—Key program interfaces are sometimes documented with usage examples: concrete code snippets that characterize common use cases for a particular data type. While such doc...
Raymond P. L. Buse, Westley Weimer
FOSSACS
2007
Springer
15 years 6 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
ISBI
2002
IEEE
16 years 1 months ago
Automatic segmentation of mammographic masses using fuzzy shadow and maximum-likelihood analysis
This study attempted to accurately segment tumors in mammograms. Although this task is considered to be a preprocessing step in a computer analysis program, it plays an important ...
Lisa Kinnard, Shih-Chung Ben Lo, Paul C. Wang, Mat...