5216 search results - page 364 / 1044 » Planning as Model Checking |
145
click to vote
DMSN
2009
ACM
15 years 11 months ago
2009
ACM
Generating a good execution plan for a declarative query has long been a central problem in data management research. With the rise in interest in wireless sensor networks (WSNs) ...
176
click to vote
MDM
2009
Springer
15 years 11 months ago
2009
Springer
Indoor navigation highly depends on context and requires flexible data structures to support the many use cases and configurations. For example, an indoor navigation system must c...
121
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
127
click to vote
KBSE
1997
IEEE
15 years 9 months ago
1997
IEEE
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
134
click to vote
FAC
2008
15 years 5 months ago
2008
We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition stru...