1888 search results - page 241 / 378 » Proof theory and computational analysis |
118
click to vote
ATVA
2004
Springer
15 years 5 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
115
click to vote
FMCAD
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
WSC
2004
15 years 3 months ago
2004
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...
FSTTCS
2008
Springer
15 years 2 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
118
click to vote
AI
2000
Springer
15 years 1 months ago
2000
Springer
We introduce an alternative conceptual basis for default reasoning in Reiter's default logic. In fact, most formal or computational treatments of default logic suffer from th...