Sciweavers

379 search results - page 9 / 76
» Strong reducibility of partial numberings
Sort
View
ATVA
2006
Springer
130views Hardware» more  ATVA 2006»
13 years 11 months ago
The Implementation of Mazurkiewicz Traces in POEM
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
Peter Niebert, Hongyang Qu
SEMWEB
2009
Springer
14 years 2 months ago
Exploiting Partial Information in Taxonomy Construction
One of the core services provided by OWL reasoners is classification: the discovery of all subclass relationships between class names occurring in an ontology. Discovering these r...
Rob Shearer, Ian Horrocks
SIBGRAPI
2009
IEEE
14 years 2 months ago
Learning Discriminative Appearance-Based Models Using Partial Least Squares
Appearance information is essential for applications such as tracking and people recognition. One of the main problems of using appearance-based discriminative models is the ambig...
William Robson Schwartz, Larry S. Davis
CONCUR
1999
Springer
13 years 12 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
SPIN
2007
Springer
14 years 1 months ago
Cartesian Partial-Order Reduction
Verifying concurrent programs is challenging since the number of thread interleavings that need to be explored can be huge even for moderate programs. We present a cartesian semant...
Guy Gueta, Cormac Flanagan, Eran Yahav, Mooly Sagi...