Sciweavers

1569 search results - page 145 / 314
» Programming contest strategy
Sort
View
118
Voted
ICFP
2008
ACM
16 years 18 days ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
IPPS
2008
IEEE
15 years 7 months ago
Programmability of the HPCS Languages: A case study with a quantum chemistry kernel
As high-end computer systems present users with rapidly increasing numbers of processors, possibly also incorporating attached co-processors, programmers are increasingly challeng...
Aniruddha G. Shet, Wael R. Elwasif, Robert J. Harr...
108
Voted
IPPS
2007
IEEE
15 years 7 months ago
Optimizing Inter-Nest Data Locality Using Loop Splitting and Reordering
With the increasing gap between processor speed and memory latency, the performance of data-dominated programs are becoming more reliant on fast data access, which can be improved...
Sofiane Naci
93
Voted
CAV
2007
Springer
121views Hardware» more  CAV 2007»
15 years 6 months ago
Algorithms for Interface Synthesis
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...
Dirk Beyer, Thomas A. Henzinger, Vasu Singh
ISSTA
2006
ACM
15 years 6 months ago
Integrating customized test requirements with traditional requirements in web application testing
Existing test suite reduction techniques employed for testing web applications have either used traditional program coverage-based requirements or usage-based requirements. In thi...
Sreedevi Sampath, Sara Sprenkle, Emily Gibson, Lor...