Sciweavers

6960 search results - page 496 / 1392
» Continuity Analysis of Programs
Sort
View
SAS
2005
Springer
162views Formal Methods» more  SAS 2005»
15 years 12 months ago
Boolean Heaps
We show that the idea of predicates on heap objects can be cast in the framework of predicate abstraction. This leads to an alternative view on the underlying concepts of three-val...
Andreas Podelski, Thomas Wies
KONVENS
2000
15 years 10 months ago
Automatic Labeling of Prosodic Events
An approach for a program is presented that automatically detects the position of pitch accents and intonation phrase (IP) boundaries from waveforms. The technique maps acoustic c...
Norbert Braunschweiler
165
Voted
FUIN
2006
81views more  FUIN 2006»
15 years 6 months ago
Redundant Call Elimination via Tupling
Redundant call elimination has been an important program optimisation process as it can produce super-linear speedup in optimised programs. In this paper, we investigate use of the...
Wei-Ngan Chin, Siau-Cheng Khoo, Neil Jones
FCCM
2009
IEEE
172views VLSI» more  FCCM 2009»
16 years 1 months ago
Evaluation of Static Analysis Techniques for Fixed-Point Precision Optimization
Abstract—Precision analysis and optimization is very important when transforming a floating-point algorithm into fixedpoint hardware implementations. The core analysis techniqu...
Jason Cong, Karthik Gururaj, Bin Liu, Chunyue Liu,...
159
Voted
SCAM
2008
IEEE
16 years 24 days ago
Automatic Determination of May/Must Set Usage in Data-Flow Analysis
Data-flow analysis is a common technique to gather program information for use in transformations such as register allocation, dead-code elimination, common subexpression elimina...
Andrew Stone, Michelle Strout, Shweta Behere