903 search results - page 15 / 181 » Completeness Results for Memory Logics |
CSFW
1999
IEEE
13 years 11 months ago
1999
IEEE
Belief-logic deductions are used in the analysis of cryptographic protocols. We show a new method to decide such logics. In addition to the familiar BAN logic, it is also applicab...
CAV
2005
Springer
14 years 1 months ago
2005
Springer
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
HPCA
2002
IEEE
14 years 7 months ago
2002
IEEE
Power dissipation has become one of the most critical factors for the continued development of both high-end and low-end computer systems. The successful design and evaluation of ...
CONCUR
1998
Springer
13 years 11 months ago
1998
Springer
This paper presents a complete axiomatization of two decidable propositional realtime linear temporal logics: Event Clock Logic (EventClockTL) and Metric Interval Temporal Logic w...
ICCAD
1997
IEEE
13 years 11 months ago
1997
IEEE
Logic replication, the duplication of logic in order to limit communication between partitions, is an effective part of a complete partitioning solution. In this paper we seek a b...