903 search results - page 90 / 181 » Completeness Results for Memory Logics |
ICCAD
2002
IEEE
14 years 5 months ago
2002
IEEE
Abstract— With the increasing cost of global communication onchip, high-performance designs for data-intensive applications require architectures that distribute hardware resourc...
DATE
2009
IEEE
14 years 3 months ago
2009
IEEE
—During post-silicon processor debugging, we need to frequently capture and dump out the internal state of the processor. Since internal state constitutes all memory elements, th...
ECAI
2004
Springer
14 years 2 months ago
2004
Springer
Friedman and Halpern have introduced the inference by plausibility structures, which provides semantics for various default logics. This is a generalization of known inferences, su...
ESOP
2000
Springer
14 years 14 days ago
2000
Springer
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
FAC
2008
13 years 9 months ago
2008
Substitution is fundamental to the theory of logic and computation. Is substitution something that we define on syntax on a case-by-case basis, or can we turn the idea of substitut...