3691 search results - page 289 / 739 » Bayesian Logic Programs |
190
click to vote
FOSSACS
2006
Springer
15 years 10 months ago
2006
Springer
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...
199
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
179
Voted
LATA
2009
Springer
16 years 1 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
153
click to vote
TPHOL
2003
IEEE
15 years 12 months ago
2003
IEEE
MetaPRL is the latest system to come out of over twenty five years of research by the Cornell PRL group. While initially created at Cornell, MetaPRL is currently a collaborative p...
179
click to vote
JLP
2007
15 years 6 months ago
2007
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...