4192 search results - page 519 / 839 » Probabilistic Logic Programming |
159
click to vote
ICFP
2010
ACM
15 years 4 months ago
2010
ACM
Most current techniques fail to achieve the dynamic update of recursive functions. A focus on execution states appears to be essential in order to implement dynamic update in this...
131
click to vote
TOPLAS
2002
15 years 4 months ago
2002
traction and information hiding K. RUSTAN M. LEINO and GREG NELSON Compaq Systems Research Center er describes an approach for verifying programs in the presence of data abstractio...
131
click to vote
SIGSOFT
2007
ACM
16 years 5 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
144
click to vote
KBSE
2007
IEEE
15 years 10 months ago
2007
IEEE
Achieving high structural coverage such as branch coverage in objectoriented programs is an important and yet challenging goal due to two main challenges. First, some branches inv...
129
click to vote
LPNMR
2007
Springer
15 years 10 months ago
2007
Springer
Logic programming under the answer-set semantics nowadays deals with numerous different notions of equivalence between programs. This is due to the fact that equivalence for substi...