Sciweavers

525 search results - page 44 / 105
» Static Interpretation of Modules
Sort
View
CSREAESA
2004
14 years 11 months ago
Identifying and Evaluating a Generic Set of Superinstructions for Embedded Java Programs
In this paper we present an approach to the optimisation of interpreted Java programs using superinstructions. Unlike existing techniques, we examine the feasibility of identifying...
Diarmuid O'Donoghue, James F. Power
ENDM
2010
86views more  ENDM 2010»
14 years 9 months ago
Mathematical programming based debugging
Verifying that a piece of software has no bugs means proving that it has certain desired properties, such as an array index not taking values outside certain Abstract interpretati...
Leo Liberti, Stéphane Le Roux, Jeremy Lecon...
IJON
2008
156views more  IJON 2008»
14 years 9 months ago
Structural identifiability of generalized constraint neural network models for nonlinear regression
Identifiability becomes an essential requirement for learning machines when the models contain physically interpretable parameters. This paper presents two approaches to examining...
Shuang-Hong Yang, Bao-Gang Hu, Paul-Henry Courn&eg...
IJCV
1998
163views more  IJCV 1998»
14 years 9 months ago
CONDENSATION - Conditional Density Propagation for Visual Tracking
The problem of tracking curves in dense visual clutter is challenging. Kalman filtering is inadequate because it is based on Gaussian densities which, being unimodal, cannot repre...
Michael Isard, Andrew Blake
CASSIS
2005
Springer
15 years 3 months ago
Modular Proof Principles for Parameterised Concretizations
Abstract. Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctn...
David Pichardie