713 search results - page 99 / 143 » Model Checking and Transitive-Closure Logic |
89
Voted
ATVA
2004
Springer
15 years 2 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...
TSMC
2010
14 years 5 months ago
2010
Traditional planning assumes reachability goals and/or full observability. In this paper, we propose a novel solution for safety and reachability planning with partial observabilit...
106
click to vote
JAIR
2010
14 years 9 months ago
2010
We present DCL-PC: a logic for reasoning about how the abilities of agents and coalitions of agents are altered by transferring control from one agent to another. The logical foun...
102
Voted
RTAS
2006
IEEE
15 years 4 months ago
2006
IEEE
A notable features of many proposed Wireless Sensor Networks (WSNs) deployments is their scale: hundreds to thousands of nodes linked together. In such systems, modeling the state...
POPL
2010
ACM
14 years 11 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...