87 search results - page 7 / 18 » On Reachability of Minimal Models of Multilattice-Based Logi... |
CSL
2009
Springer
14 years 1 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
PPDP
2009
Springer
14 years 1 months ago
2009
Springer
We propose a novel type-based model checking algorithm for higher-order recursion schemes. As shown by Kobayashi, verification problems of higher-order functional programs can ea...
NMR
2004
Springer
14 years 13 days ago
2004
Springer
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
ICLP
2009
Springer
14 years 7 months ago
2009
Springer
Multiagent planning deals with the problem of generating plans for multiple agents. It requires formalizing ways for the agents to interact and cooperate, in order to achieve their...
ISCA
1999
IEEE
13 years 11 months ago
1999
IEEE
Modern compilers must expose sufficient amounts of Instruction-Level Parallelism (ILP) to achieve the promised performance increases of superscalar and VLIW processors. One of the...