Sciweavers

333 search results - page 8 / 67
» On the complexity of partial order trace model checking
Sort
View
TAMC
2009
Springer
14 years 2 months ago
Best-Order Streaming Model
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
Atish Das Sarma, Richard J. Lipton, Danupon Nanong...
PVLDB
2010
135views more  PVLDB 2010»
13 years 2 months ago
Efficient Skyline Evaluation over Partially Ordered Domains
Although there has been a considerable body of work on skyline evaluation in multidimensional data with totally ordered attribute domains, there are only a few methods that consid...
Shiming Zhang, Nikos Mamoulis, Ben Kao, David Wai-...
PTS
2003
127views Hardware» more  PTS 2003»
13 years 9 months ago
An Automata-Based Approach to Property Testing in Event Traces
We present a framework for property testing where a partially ordered execution trace of a distributed system is modeled by a collection of communicating automata. We prove that th...
Hesham Hallal, Sergiy Boroday, Andreas Ulrich, Ale...
ICDE
2009
IEEE
192views Database» more  ICDE 2009»
14 years 9 months ago
Topologically Sorted Skylines for Partially Ordered Domains
The vast majority of work on skyline queries considers totally ordered domains, whereas in many applications some attributes are partially ordered, as for instance, domains of set ...
Dimitris Sacharidis, Stavros Papadopoulos, Dimitri...
STTT
2010
97views more  STTT 2010»
13 years 5 months ago
Distributed dynamic partial order reduction
Abstract. Runtime (dynamic) model checking is a promising verification methodology for real-world threaded software because of its many features, the prominent ones being: (i) it ...
Yu Yang, Xiaofang Chen, Ganesh Gopalakrishnan, Rob...