181 search results - page 21 / 37 » On the Completeness of Propositional Hoare Logic |
105
click to vote
ATAL
2005
Springer
15 years 5 months ago
2005
Springer
We present dcl-pc: a dynamic logic of delegation and cooperation. The logical foundation of dcl-pc is cl-pc, a logic for reasoning about cooperation in which the powers of agents ...
193
click to vote
POPL
2008
ACM
16 years 2 days ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
CADE
2003
Springer
16 years 2 days ago
2003
Springer
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...
109
click to vote
AML
2010
14 years 12 months ago
2010
Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'. We ext...
AML
2006
14 years 11 months ago
2006
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...