Sciweavers

57 search results - page 2 / 12
» Variable elimination for building interpreters
Sort
View
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
14 years 9 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
MICAI
2007
Springer
14 years 2 months ago
Building Fine Bayesian Networks Aided by PSO-Based Feature Selection
A successful interpretation of data goes through discovering crucial relationships between variables. Such a task can be accomplished by a Bayesian network. The dark side is that, ...
María del Carmen Chávez, Gladys Casa...
POPL
2009
ACM
14 years 9 months ago
Automatic modular abstractions for linear constraints
c Modular Abstractions for Linear Constraints David Monniaux VERIMAG June 27, 2008 se a method for automatically generating abstract transformers for static by abstract interpreta...
David Monniaux
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 8 months ago
Automatic Modular Abstractions for Template Numerical Constraints
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
David Monniaux
PLDI
2010
ACM
14 years 1 months ago
Smooth interpretation
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
Swarat Chaudhuri, Armando Solar-Lezama