903 search results - page 31 / 181 » Completeness Results for Memory Logics |
CORR
2006
Springer
13 years 8 months ago
2006
Springer
of proposed research. A short bibliography is optional. Domain theory has been developed around 40 years since 1970s by D. Scott, and S. Abramsky revealed the "junction betwee...
AMAI
2004
Springer
14 years 2 months ago
2004
Springer
The paper integrates automatically generated case-splitting expressions, and an efficient translation to CNF, in order to formally verify an out-of-order superscalar processor havi...
CP
2006
Springer
14 years 12 days ago
2006
Springer
This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). Given a conditional task graph charac...
SISW
2003
IEEE
14 years 1 months ago
2003
IEEE
— Smart cards are widely known for their tamper resistance, but only contain a small amount of memory. Though very small, this memory often contains highly valuable information (...
IJCAI
1989
13 years 9 months ago
1989
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...