903 search results - page 25 / 181 » Completeness Results for Memory Logics |
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities ...
MTDT
2000
IEEE
13 years 12 months ago
2000
IEEE
A new approach to diagnostic testing of embedded memories is presented which enables the design of tests that provide complete detection and distinguishing of all faults in a give...
MASCOTS
2010
13 years 9 months ago
2010
In this paper, we develop a queuing theory based analytical model to evaluate the performance of transactional memory. Based on the statistical characteristics observed on actual e...
KR
2004
Springer
14 years 26 days ago
2004
Springer
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
It is well known that bisimulation on µ-expressions cannot be finitely axiomatised in equational logic. Complete axiomatisations such as those of Milner and Bloom/´Esik necessar...