903 search results - page 155 / 181 » Completeness Results for Memory Logics |
146
click to vote
CHI
1998
ACM
15 years 10 months ago
1998
ACM
considered simply, but a more complex evaluation of the effects of performing the tasks. For example, an educational activity that learners complete quickly and accurately is of no...
159
click to vote
ITP
2010
15 years 10 months ago
2010
CertiCrypt is a general framework to certify the security of cryptographic primitives in the Coq proof assistant. CertiCrypt adopts the code-based paradigm, in which the statement ...
158
click to vote
DLOG
2008
15 years 8 months ago
2008
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR--a fragment of SROIQ witho...
167
click to vote
IITA
2007
15 years 7 months ago
2007
: The studies on user and mobile phone interaction have been an important problem in small screen interface design. The present study was intend to investigate the impact of three ...
162
click to vote
ET
2002
15 years 6 months ago
2002
In this paper we present a new reseeding technique for test-per-clock test pattern generation suitable for at-speed testing of circuits with random-pattern resistant faults. Our te...