Sciweavers

348 search results - page 22 / 70
» Using Case-Based Reasoning to Write Constraint Programs
Sort
View
DATE
2007
IEEE
142views Hardware» more  DATE 2007»
15 years 7 months ago
Optimizing instruction-set extensible processors under data bandwidth constraints
We present a methodology for generating optimized architectures for data bandwidth constrained extensible processors. We describe a scalable Integer Linear Programming (ILP) formu...
Kubilay Atasu, Robert G. Dimond, Oskar Mencer, Way...
TLDI
2003
ACM
134views Formal Methods» more  TLDI 2003»
15 years 6 months ago
Scrap your boilerplate: a practical design pattern for generic programming
We describe a design pattern for writing programs that traverse data structures built from rich mutually-recursive data types. Such programs often have a great deal of “boilerpl...
Ralf Lämmel, Simon L. Peyton Jones
TACAS
2009
Springer
122views Algorithms» more  TACAS 2009»
15 years 8 months ago
Test Input Generation for Programs with Pointers
Software testing is an essential process to improve software quality in practice. Researchers have proposed several techniques to automate parts of this process. In particular, sym...
Dries Vanoverberghe, Nikolai Tillmann, Frank Piess...
CAISE
2005
Springer
15 years 6 months ago
Automated Reasoning on Feature Models
Abstract Software Product Line (SPL) Engineering has proved to be an effective method for software production. However, in the SPL community it is well recognized that variability ...
David Benavides, Pablo Trinidad Martín-Arro...
FOSSACS
2007
Springer
15 years 7 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard