3691 search results - page 524 / 739 » Bayesian Logic Programs |
182
click to vote
VMCAI
2009
Springer
16 years 1 months ago
2009
Springer
We present the first shape analysis for multithreaded programs that avoids the explicit enumeration of execution-interleavings. Our approach is to automatically infer a resource ...
170
Voted
HASKELL
2009
ACM
16 years 1 months ago
2009
ACM
In this paper we describe the architecture of the Utrecht Haskell Compiler (UHC). UHC is a new Haskell compiler, that supports most (but not all) Haskell 98 features, plus some ex...
172
Voted
MIDDLEWARE
2007
Springer
16 years 1 months ago
2007
Springer
Developing applications for sensor networks is a challenging task. Most programming systems narrowly focus on programming issues while ignoring that programming represents only a ...
165
Voted
SAS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
184
click to vote
ICLP
2005
Springer
16 years 16 days ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...