903 search results - page 56 / 181 » Completeness Results for Memory Logics |
ISCA
2010
IEEE
14 years 1 months ago
2010
IEEE
SIMD organizations amortize the area and power of fetch, decode, and issue logic across multiple processing units in order to maximize throughput for a given area and power budget...
POPL
2008
ACM
14 years 9 months 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...
RTA
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we consider the monadic second order logic (MSO) and two of its extensions, namely Counting MSO (CMSO) and Presburger MSO (PMSO), interpreted over unranked and unord...
LORI
2009
Springer
14 years 1 months ago
2009
Springer
We present in this work a sound and complete modal logic called EDLA (Epistemic Dynamic Logic of Agency) integrating the concepts of joint action, preference and knowledge and ena...
KR
2010
Springer
14 years 22 days ago
2010
Springer
We investigate a class of first-order temporal epistemic logics for the specification of multi-agent systems. We consider well-known properties of multi-agent systems including ...