Sciweavers

1492 search results - page 21 / 299
» Testing Properties of Constraint-Graphs
Sort
View
JUCS
2006
109views more  JUCS 2006»
15 years 3 months ago
Verifying Real-Time Properties of tccp Programs
: The size and complexity of software systems are continuously increasing, which makes them difficult and labor-intensive to develop, test and evolve. Since concurrent systems are ...
María Alpuente, María-del-Mar Gallar...
ICALP
2001
Springer
15 years 7 months ago
Testing Hypergraph Coloring
In this paper we initiate the study of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain prope...
Artur Czumaj, Christian Sohler
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 3 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
96
Voted
ESA
2010
Springer
203views Algorithms» more  ESA 2010»
15 years 4 months ago
Testing Euclidean Spanners
In this paper we develop a property testing algorithm for the problem of testing whether a directed geometric graph with bounded (out)degree is a (1 + )-spanner.
Frank Hellweg, Melanie Schmidt, Christian Sohler
KBSE
2010
IEEE
15 years 1 months ago
A bounded statistical approach for model checking of unbounded until properties
We study the problem of statistical model checking of probabilistic systems for PCTL unbounded until property P1p(ϕ1 U ϕ2) (where 1 ∈ {<, ≤, >, ≥}) using the computa...
Ru He, Paul Jennings, Samik Basu, Arka P. Ghosh, H...