Sciweavers

743 search results - page 84 / 149
» Optimal Abstraction on Real-Valued Programs
Sort
View
SIGSOFT
2004
ACM
15 years 10 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
SASO
2008
IEEE
15 years 4 months ago
Cells Are Plausible Targets for High-Level Spatial Languages
—High level languages greatly increase the power of a programmer at the cost of programs that consume more s than those written at a lower level of abstraction. This inefficienc...
Jacob Beal, Jonathan Bachrach
ECOOP
2001
Springer
15 years 2 months ago
Precise Constraint-Based Type Inference for Java
Abstract. Precise type information is invaluable for analysis and optimization of object-oriented programs. Some forms of polymorphism found in object-oriented languages pose signi...
Tiejun Wang, Scott F. Smith
BIRTHDAY
2003
Springer
15 years 3 months ago
Comet in Context
Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supplychain management, and resource allocation. They often give...
Laurent Michel, Pascal Van Hentenryck
IPPS
2010
IEEE
14 years 7 months ago
Executing task graphs using work-stealing
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha