Sciweavers

945 search results - page 62 / 189
» Incremental Branching Programs
Sort
View
COMPSAC
2005
IEEE
14 years 2 months ago
Goal-Oriented Test Data Generation for Programs with Pointer Variables
Automatic test data generation leads to the identification of input values on which a selected path or a selected branch is executed within a program (path-oriented vs goalorient...
Arnaud Gotlieb, Tristan Denmat, Bernard Botella
OL
2011
177views Neural Networks» more  OL 2011»
12 years 12 months ago
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of proce
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
Juan P. Ruiz, Ignacio E. Grossmann
TACAS
2010
Springer
225views Algorithms» more  TACAS 2010»
14 years 4 months ago
Automated Termination Analysis for Programs with Second-Order Recursion
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
Markus Aderhold
SCAM
2005
IEEE
14 years 2 months ago
Control Flow Graph Reconstruction for Assembly Language Programs with Delayed Instructions
Most software for embedded systems, including digital signal processing systems, is coded in assembly language. For both understanding the software and for reverse compiling it to...
Nerina Bermudo, Andreas Krall, R. Nigel Horspool
MICCAI
2005
Springer
14 years 10 months ago
Particle Filters, a Quasi-Monte Carlo Solution for Segmentation of Coronaries
Abstract. In this paper we propose a Particle Filter-based approach for the segmentation of coronary arteries. To this end, successive planes of the vessel are modeled as unknown s...
Charles Florin, Nikos Paragios, James Williams