Sciweavers

1097 search results - page 83 / 220
» Testing Graph Isomorphism
Sort
View
ICSE
2008
IEEE-ACM
15 years 10 months ago
Data flow testing of service-oriented workflow applications
WS-BPEL applications are a kind of service-oriented application. They use XPath extensively to integrate loosely-coupled workflow steps. However, XPath may extract wrong data from...
Lijun Mei, W. K. Chan, T. H. Tse
SIGSOFT
2008
ACM
15 years 10 months ago
Inter-context control-flow and data-flow test adequacy criteria for nesC applications
NesC is a programming language for applications that run on top of networked sensor nodes. Such an application mainly uses an interrupt to trigger a sequence of operations, known ...
Zhifeng Lai, Shing-Chi Cheung, Wing Kwong Chan
ESA
1993
Springer
109views Algorithms» more  ESA 1993»
15 years 2 months ago
Optimal Upward Planarity Testing of Single-Source Digraphs
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...
Paola Bertolazzi, Giuseppe Di Battista, Carlo Mann...
ICFEM
2009
Springer
15 years 2 months ago
An Empirical Study of Structural Constraint Solving Techniques
Structural constraint solving allows finding object graphs that satisfy given constraints, thereby enabling software reliability tasks, such as systematic testing and error recove...
Junaid Haroon Siddiqui, Sarfraz Khurshid
ISSTA
2004
ACM
15 years 3 months ago
Optimal strategies for testing nondeterministic systems
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
Lev Nachmanson, Margus Veanes, Wolfram Schulte, Ni...