1776 search results - page 197 / 356 » Using a Logic Programming Language with Persistence and Cont... |
133
Voted
CSL
2009
Springer
15 years 10 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
211
click to vote
POPL
2005
ACM
16 years 3 months ago
2005
ACM
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
136
Voted
AGI
2008
15 years 5 months ago
2008
: Indefinite probabilities are a novel technique for quantifying uncertainty, which were created as part of the PLN (Probabilistic Logic Networks) logical inference engine, which i...
125
click to vote
HASKELL
2008
ACM
15 years 4 months ago
2008
ACM
The “zipper” is a well known design pattern for providing a cursorlike interface to a data structure. However, the classic treatise by Huet only scratches the surface of some ...
128
click to vote
ICFP
2008
ACM
16 years 3 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...