54 search results - page 7 / 11 » Model Checking Using Tabled Rewriting |
ICLP
1995
Springer
13 years 11 months ago
1995
Springer
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
ASPLOS
1996
ACM
14 years 3 days ago
1996
ACM
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
JTRES
2010
ACM
13 years 8 months ago
2010
ACM
Chip-multiprocessors offer increased processing power at a low cost. However, in order to use them for real-time systems, tasks have to be scheduled efficiently and predictably. I...
AMAST
2010
Springer
13 years 3 months ago
2010
Springer
Maude modules can be understood as models that can be formally analyzed and verified with respect to different properties expressing various formal requirements. However, Maude lac...
PST
2008
13 years 9 months ago
2008
Can we trust without any reliable truth information? Most trust architectures work in a similar way: a trustor makes some observations, rates the trustee, and makes recommendations...