1144 search results - page 162 / 229 » Logic programming for combinatorial problems |
220
click to vote
POPL
2009
ACM
16 years 3 months ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
128
click to vote
ICFP
2005
ACM
16 years 2 months ago
2005
ACM
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...
108
click to vote
ESOP
2012
Springer
13 years 10 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
125
click to vote
ICSE
2010
IEEE-ACM
15 years 4 months ago
2010
IEEE-ACM
The transition from single-core to multi-core processors has made multi-threaded software an important subject over the last years in computer-aided verification. Model checkers ...
161
click to vote
JCST
2010
14 years 9 months ago
2010
With recent efforts to build foundational certified software systems, two different approaches have been proposed to certify thread context switching. One is to certify both thread...