Sciweavers

5216 search results - page 426 / 1044
» Planning as Model Checking
Sort
View
FUIN
2000
115views more  FUIN 2000»
15 years 6 months ago
Constructing the Least Models for Positive Modal Logic Programs
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
Linh Anh Nguyen
ICPP
1993
IEEE
15 years 11 months ago
A Unified Model for Concurrent Debugging
: Events are occurrence instances of actions. The thesis of this paper is that the use of “actions”, instead of events, greatly simplifies the problem of concurrent debugging....
S. I. Hyder, John Werth, James C. Browne
FCT
2007
Springer
16 years 28 days ago
On Notions of Regularity for Data Languages
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
Henrik Björklund, Thomas Schwentick
ICDE
2010
IEEE
211views Database» more  ICDE 2010»
16 years 1 months ago
ROX: The robustness of a run-time XQuery optimizer against correlated data
— We demonstrate ROX, a run-time optimizer of XQueries, that focuses on finding the best execution order of XPath steps and relational joins in an XQuery. The problem of join or...
Riham Abdel Kader, Peter A. Boncz, Stefan Manegold...
ICSE
2004
IEEE-ACM
16 years 6 months ago
Assume-Guarantee Verification of Source Code with Design-Level Assumptions
Model checking is an automated technique that can be used to determine whether a system satisfies certain required properties. To address the "state explosion" problem a...
Dimitra Giannakopoulou, Corina S. Pasareanu, Jamie...