Sciweavers

6248 search results - page 210 / 1250
» Programming in a data factory
Sort
View
ATVA
2007
Springer
77views Hardware» more  ATVA 2007»
16 years 23 days ago
Proving Termination of Tree Manipulating Programs
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tom&...
EUROPAR
2007
Springer
16 years 22 days ago
Delayed Side-Effects Ease Multi-core Programming
Computer systems are increasingly parallel and heterogeneous, while programs are still largely written in sequential languages. The obvious suggestion that the compiler should auto...
Anton Lokhmotov, Alan Mycroft, Andrew Richards
HASKELL
2005
ACM
16 years 4 days ago
There and back again: arrows for invertible programming
Invertible programming occurs in the area of data conversion where it is required that the conversion in one direction is the inverse of the other. For that purpose, we introduce ...
Artem Alimarine, Sjaak Smetsers, Arjen van Weelden...
SIGCSE
2005
ACM
102views Education» more  SIGCSE 2005»
16 years 3 days ago
Interpreting Java program runtimes
Many instructors use program runtimes to illustrate and reinforce algorithm complexity concepts. Hardware, operating system and compilers have historically influenced runtime resu...
Stuart A. Hansen
PARA
2004
Springer
15 years 12 months ago
A Tool to Display Array Access Patterns in OpenMP Programs
Abstract. A program analysis tool can play an important role in helping users understand and improve OpenMP codes. Array privatization is one of the most effective ways to improve...
Oscar Hernandez, Chunhua Liao, Barbara M. Chapman