333 search results - page 14 / 67 » On the complexity of partial order trace model checking |
MFDBS
1991
13 years 11 months ago
1991
We study an approach to relational databases which treats relations not as subsets of a Cartesian product but as subsets of some domain { a partially ordered space of descriptions...
ICFEM
2009
Springer
13 years 5 months ago
2009
Springer
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
CVPR
2007
IEEE
2007
IEEE
Leveraging temporal, contextual and ordering constraints for recognizing complex activities in video
14 years 9 months ago
We present a scalable approach to recognizing and describing complex activities in video sequences. We are interested in long-term, sequential activities that may have several par...
ATVA
2008
Springer
13 years 9 months ago
2008
Springer
We present a new property driven pruning algorithm in dynamic model checking to efficiently detect race conditions in multithreaded programs. The main idea is to use a lockset base...
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Directed model checking is a well-established technique that is tailored to fast detection of system states that violate a given safety property. This is achieved by inï¬...