Sciweavers

1392 search results - page 118 / 279
» Dynamic Data Structure Analysis for Java Programs
Sort
View
PLDI
2009
ACM
15 years 4 months ago
Snugglebug: a powerful approach to weakest preconditions
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
Satish Chandra, Stephen J. Fink, Manu Sridharan
CAV
2006
Springer
146views Hardware» more  CAV 2006»
15 years 1 months ago
Termination Analysis with Calling Context Graphs
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
Panagiotis Manolios, Daron Vroon
CASES
2008
ACM
14 years 12 months ago
Efficient vectorization of SIMD programs with non-aligned and irregular data access hardware
Automatic vectorization of programs for partitioned-ALU SIMD (Single Instruction Multiple Data) processors has been difficult because of not only data dependency issues but also n...
Hoseok Chang, Wonyong Sung
ICMCS
2008
IEEE
207views Multimedia» more  ICMCS 2008»
15 years 4 months ago
Structure learning in a Bayesian network-based video indexing framework
Several stochastic models provide an effective framework to identify the temporal structure of audiovisual data. Most of them need as input a first video structure, i.e. connecti...
Siwar Baghdadi, Guillaume Gravier, Claire-Hé...
POPL
2005
ACM
15 years 10 months ago
Mutatis mutandis: safe and predictable dynamic software updating
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
Gareth Stoyle, Michael W. Hicks, Gavin M. Bierman,...