7092 search results - page 766 / 1419 » Parallelizing constraint programs |
186
click to vote
IPPS
2010
IEEE
15 years 5 months ago
2010
IEEE
Software Transactional Memories (STMs) are emerging as a highly attractive programming model, thanks to their ability to mask concurrency management issues to the overlying applic...
227
click to vote
EUROPAR
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Traditional parallel programming methodologies for improving performance assume cache-based parallel systems. However, new architectures, like the IBM Cyclops-64 (C64), b...
316
click to vote
POPL
2005
ACM
16 years 7 months ago
2005
ACM
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
202
click to vote
ICSE
2010
IEEE-ACM
16 years 2 days ago
2010
IEEE-ACM
The efficacy of mutation analysis depends heavily on its capability to mutate programs in such a way that they remain executable and exhibit deviating behaviour. Whereas the forme...
183
click to vote
ICAI
2004
15 years 8 months ago
2004
This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex logic program. We limit our attention to pro...