3845 search results - page 405 / 769 » Belief Logic Programming |
164
click to vote
LOGCOM
2007
15 years 6 months ago
2007
We begin by showing how to faithfully encode the Classical Modal Display Logic (CMDL) of Wansing into the Calculus of Structures (CoS) of Guglielmi. Since every CMDL calculus enjo...
188
click to vote
JAPLL
2010
15 years 1 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
221
click to vote
CONCUR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
150
click to vote
OOPSLA
2007
Springer
16 years 26 days ago
2007
Springer
Accidental mutation is a major source of difficult-to-detect errors in object-oriented programs. We have built tools that detect and prevent such errors. The tools include a java...
199
click to vote
DAGSTUHL
2001
15 years 8 months ago
2001
A powerful approach to finding errors in computer software is to translate a given program into a verification condition, a logical formula that is valid if and only if the program...