655 search results - page 42 / 131 » On Flat Programs with Lists |
110
click to vote
PPOPP
2012
ACM
13 years 7 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
The success of a genetic programming system in solving a problem is often a function of the available computational resources. For many problems, the larger the population size an...
VL
1993
IEEE
15 years 4 months ago
1993
IEEE
This paper presents a new programming language named SPARCL that has four major elements: it is a visual language, it is a logic programming language, it relies on sets to organiz...
194
click to vote
POPL
2008
ACM
16 years 4 days ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
204
click to vote
POPL
2007
ACM
16 years 4 days ago
2007
ACM
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...