105 search results - page 15 / 21 » Dynamic Partial Order Reduction Using Probe Sets |
FM
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
FMICS
2008
Springer
13 years 8 months ago
2008
Springer
Different approaches have been developed to mitigate the state space explosion of model checking techniques. Among them, symbolic verification techniques use efficient representati...
CP
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
IJVR
2008
13 years 6 months ago
2008
Museums like marine aquariums are facing a difficult problem when trying to deliver information to their visitors. The exhibits they propose are dynamic by definition. Each may con...
EDBT
2012
ACM
11 years 9 months ago
2012
ACM
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...