Sciweavers

4716 search results - page 117 / 944
» Iterative-free program analysis
Sort
View
POPL
2010
ACM
15 years 7 months ago
Static Determination of Quantitative Resource Usage for Higher-Order Programs
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
IPL
2007
78views more  IPL 2007»
14 years 9 months ago
Ensuring the quasi-termination of needed narrowing computations
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
CPAIOR
2007
Springer
15 years 4 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
PRL
2007
200views more  PRL 2007»
14 years 9 months ago
Generative learning of visual concepts using multiobjective genetic programming
This paper introduces a novel method of visual learning based on Genetic Programming, which evolves a population of individuals (image analysis programs) that process attributed v...
Krzysztof Krawiec
CGO
2011
IEEE
14 years 1 months ago
Flow-sensitive pointer analysis for millions of lines of code
—Many program analyses benefit, both in precision and performance, from precise pointer analysis. An important dimension of pointer analysis precision is flow-sensitivity, whic...
Ben Hardekopf, Calvin Lin