Sciweavers

336 search results - page 10 / 68
» Relevance heuristics for program analysis
Sort
View
CIAC
1997
Springer
111views Algorithms» more  CIAC 1997»
13 years 11 months ago
A Meticulous Analysis of Mergesort Programs
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
Jyrki Katajainen, Jesper Larsson Träff
SAS
2007
Springer
14 years 1 months ago
Program Analysis Using Symbolic Ranges
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
Sriram Sankaranarayanan, Franjo Ivancic, Aarti Gup...
IPCO
2007
126views Optimization» more  IPCO 2007»
13 years 9 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
ISSTA
2009
ACM
14 years 2 months ago
Advanced code coverage analysis using substring holes
Code coverage is a common aid in the testing process. It is generally used for marking the source code segments that were executed and, more importantly, those that were not execu...
Yoram Adler, Eitan Farchi, Moshe Klausner, Dan Pel...
ISMIR
2004
Springer
90views Music» more  ISMIR 2004»
14 years 29 days ago
Automatic extraction of music descriptors from acoustic signals
High-Level music descriptors are key ingredients for music information retrieval systems. Although there is a long tradition in extracting information from acoustic signals, the f...
François Pachet, Aymeric Zils