Sciweavers

499 search results - page 26 / 100
» LTL satisfiability checking
Sort
View
ICDT
2009
ACM
125views Database» more  ICDT 2009»
14 years 10 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
CONCUR
2011
Springer
12 years 9 months ago
Reasoning about Threads with Bounded Lock Chains
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
Vineet Kahlon
SIGSOFT
2010
ACM
13 years 4 months ago
Analyzing hierarchical complex real-time systems
Specification and verification of real-time systems are important research topics which have practical implications. In this work, we present a self-contained toolkit to analyze r...
Yang Liu 0003, Jun Sun 0001, Jin Song Dong
EDBTW
2006
Springer
14 years 1 months ago
Unsatisfiability Reasoning in ORM Conceptual Schemes
ORM (Object-Role Modeling) is a rich and well-known conceptual modeling method. As ORM has a formal semantics, reasoning tasks such as satisfiability checking of an ORM schema natu...
Mustafa Jarrar, Stijn Heymans
CAV
2005
Springer
127views Hardware» more  CAV 2005»
14 years 3 months ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala