Results 1  10
of
30
The NPcompleteness column: an ongoing guide
 JOURNAL OF ALGORITHMS
, 1987
"... This is the nineteenth edition of a (usually) quarterly column that covers new developments in the theory of NPcompleteness. The presentation is modeled on that used by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NPCompleteness," W. H. Freem ..."
Abstract

Cited by 239 (0 self)
 Add to MetaCart
(Show Context)
This is the nineteenth edition of a (usually) quarterly column that covers new developments in the theory of NPcompleteness. The presentation is modeled on that used by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NPCompleteness," W. H. Freeman & Co., New York, 1979 (hereinafter referred to as "[G&J]"; previous columns will be referred to by their dates). A background equivalent to that provided by [G&J] is assumed, and, when appropriate, crossreferences will be given to that book and the list of problems (NPcomplete and harder) presented there. Readers who have results they would like mentioned (NPhardness, PSPACEhardness, polynomialtimesolvability, etc.) or open problems they would like publicized, should
Alldupath Coverage for Parallel Programs
 ACM SigSoft International Symposium on Software Testing and Analysis
, 1998
"... One significant challenge in bringing the power of parallel machines to application programmers is providing them with a suite of software tools similar to the tools that sequential programmers currently utilize. In particular, automatic or semiautomatic testing tools for parallel programs are lack ..."
Abstract

Cited by 31 (2 self)
 Add to MetaCart
(Show Context)
One significant challenge in bringing the power of parallel machines to application programmers is providing them with a suite of software tools similar to the tools that sequential programmers currently utilize. In particular, automatic or semiautomatic testing tools for parallel programs are lacking. This paper describes our work in automatic generation of alldupaths for testing parallel programs. Our goal is to demonstrate that, with some extension, sequential test data adequacy criteria are still applicable to parallel program testing. The concepts and algorithms in this paper have been incorporated as the foundation of our DELaware PArallel Software Testing Aid, della pasta. Keywords: parallel programming, testing tool, alldupath coverage 1 Introduction Recent trends in computer architecture and computer networks suggest that parallelism will pervade workstations, personal computers, and network clusters, causing parallelism to become available to more than just the users ...
A systematic approach to generate inputs to test UML design models
 In Proceedings of the 17th International Symposium on Software Reliability Engineering
, 2006
"... Practical model validation techniques are needed for model driven development (MDD) techniques to succeed. This paper presents an approach to generating inputs to test UML design models that are produced in the detailed design phase of an MDD project. A symbolic execution based approach is used to d ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
(Show Context)
Practical model validation techniques are needed for model driven development (MDD) techniques to succeed. This paper presents an approach to generating inputs to test UML design models that are produced in the detailed design phase of an MDD project. A symbolic execution based approach is used to derive test input constraints from the paths of a Variable Assignment Graph, which integrates information from UML class and sequence diagrams. The constraints are solved using Alloy, a configuration constraint solver, to obtain the test inputs. The results of a pilot study carried out to explore the fault detection capability of the test inputs are reported.
On the Compilability of Diagnosis, Planning, Reasoning about Actions, Belief Revision, etc.
 IN PROCEEDINGS OF THE SIXTH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING (KR’98
, 1998
"... In this paper we investigate the usefulness of preprocessing part of the input of a given problem to improve the efficiency. We extend the results of [Cadoli et al., 1996] by giving sufficient conditions to prove the unfeasibility of reducing the online complexity via an offline preprocessing. ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
In this paper we investigate the usefulness of preprocessing part of the input of a given problem to improve the efficiency. We extend the results of [Cadoli et al., 1996] by giving sufficient conditions to prove the unfeasibility of reducing the online complexity via an offline preprocessing. We analyze the problems of diagnosis [Peng and Reggia, 1986], planning [Bylander, 1991], reasoning about actions [Gelfond and Lifschitz, 1993], and belief revision [Williams, 1994]. We analyze other problems from various fields.
Efficient Algorithms for Constructing Testing Sets, Covering Paths, and Minimum Flows
 AT&T BELL LABORATORIES TECH. MEMO
, 1987
"... Although testing is an essential part of program and circuit design, the area is still more an art than a science. This paper considers several fundamental problems arising in program and circuit testing, and abstracts them in terms of pathcovering problems on graphs. These problems are representat ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Although testing is an essential part of program and circuit design, the area is still more an art than a science. This paper considers several fundamental problems arising in program and circuit testing, and abstracts them in terms of pathcovering problems on graphs. These problems are representative of important classes of graphoptimization problems, and we introduce a technique called "balancing" to solve these problems. This technique yields algorithms that are faster, simpler, and easier to implement than those obtained by applying existing methods. Included in the classes of problems are minimum networkflow problems and the Chinesepostman problem.
An optimal representative set selection method
 Inform. Softw. Technol
, 2000
"... The optimal representative set selection problem is defined thus: given a set of test requirements and a test suite that satisfies all test requirements, find a subset of the test suite containing a minimum number of test cases that still satisfies all test requirements. Existing methods for solving ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
The optimal representative set selection problem is defined thus: given a set of test requirements and a test suite that satisfies all test requirements, find a subset of the test suite containing a minimum number of test cases that still satisfies all test requirements. Existing methods for solving the representative set selection problem do not guarantee that obtained representative sets are optimal (i.e. minimal). The enhanced zero–one optimal path set selection method [C.G. Chung, J.G. Lee, An enhanced zero–one optimal path set selection method, Journal of Systems and Software, 39(2) (1997) 145–164] solves the socalled optimal path set selection problem, and can be adapted to solve the optimal representative set selection problem by considering paths as test cases and components to be covered (e.g. branches) as test
Abstract: The Cost of Learning Directed Cuts
"... Classifying vertices in digraphs is an important machine learning setting with many applications. We consider learning problems on digraphs with three characteristic properties: (i) The target concept corresponds to a directed cut; (ii) the total cost of finding the cut has to be bounded a priori; a ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Classifying vertices in digraphs is an important machine learning setting with many applications. We consider learning problems on digraphs with three characteristic properties: (i) The target concept corresponds to a directed cut; (ii) the total cost of finding the cut has to be bounded a priori; and (iii) the target concept may change due to a hidden context. For one motivating example consider classifying intermediate products in some process, e.g., for manufacturing cars or the control flow in software, as faulty or correct. The process can be represented by a digraph and the concept is monotone: Typical faults that appear in an intermediate product will also be present in later stages of the product. The concept may depend on a hidden variable as some preassembled parts may vary and the fault may occur only for some charges and not for others. In order to be able to trade off between the cost of having a faulty product and the costs needed to find the cause of the fault, tight performance guarantees for finding the bug are needed. Performance guarantees proposed in machine learning literature can be distinguished
How To Guard A Graph?
"... We initiate the study of the algorithmic foundations of games in which a set of cops has to guard a region in a graph (or digraph) against a robber. The robber and the cops are placed on vertices of the graph; they take turns in moving to adjacent vertices (or staying). The goal of the robber is to ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We initiate the study of the algorithmic foundations of games in which a set of cops has to guard a region in a graph (or digraph) against a robber. The robber and the cops are placed on vertices of the graph; they take turns in moving to adjacent vertices (or staying). The goal of the robber is to enter the guarded region at a vertex with no cop on it. The problem is to find the minimum number of cops needed to prevent the robber from entering the guarded region. The problem is highly nontrivial even if the robber’s or the cops’ regions are restricted to very simple graphs. The computational complexity of the problem depends heavily on the chosen restriction. In particular, if the robber’s region is only a path, then the problem can be solved in polynomial time. When the robber moves in a tree (or even in a star), then the decision version of the problem is NPcomplete. Furthermore, if the robber is moving in a directed acyclic graph, the problem becomes PSPACEcomplete.
Alluses testing of shared memory parallel programs
 SOFTWARE TESTING, VERIFICATION, AND RELIABILITY JOURNAL
, 2003
"... Parallelism has become the way of life for many scientific programmers. A significant challenge in bringing the power of parallel machines to these programmers is providing them with a suite of software tools similar to the tools that sequential programmers currently utilize. Unfortunately, writing ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Parallelism has become the way of life for many scientific programmers. A significant challenge in bringing the power of parallel machines to these programmers is providing them with a suite of software tools similar to the tools that sequential programmers currently utilize. Unfortunately, writing correct parallel programs remains a challenging task. In particular, automatic or semiautomatic testing tools for parallel programs are lacking. This paper takes a first step in developing an approach to providing alluses coverage for parallel programs. A testing framework and theoretical foundations for structural testing are presented, including test data adequacy criteria and hierarchy, formulation and illlustration of alluses testing problems, classification of alluses test cases for parallel programs, and both theoretical and empirical results with regard to what can be achieved with alluses coverage for parallel programs.
Paired 2Disjoint Path Covers and Strongly Hamiltonian Laceability of Bipartite HypercubeLike Graphs
, 2013
"... A paired manytomany kdisjoint path cover (paired kDPC for short) of a graph is a set of k vertexdisjoint paths joining k distinct sourcesink pairs that altogether cover every vertex of the graph. We consider the problem of constructing paired 2DPC’s in an mdimensional bipartite HLgraph, Xm, ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
A paired manytomany kdisjoint path cover (paired kDPC for short) of a graph is a set of k vertexdisjoint paths joining k distinct sourcesink pairs that altogether cover every vertex of the graph. We consider the problem of constructing paired 2DPC’s in an mdimensional bipartite HLgraph, Xm, and its application in finding the longest possible paths. It is proved that every Xm, m ≥ 4, has a faultfree paired 2DPC if there are at most m − 3 faulty edges and the set of sources and sinks is balanced in the sense that it contains the same number of vertices from each part of the bipartition. Furthermore, every Xm, m ≥ 4, has a paired 2DPC in which the two paths have the same length if each sourcesink pair is balanced. Using 2DPC properties, we show that every Xm, m ≥ 3, with either at most m − 2 faulty edges or one faulty vertex and at most m − 3 faulty edges is strongly Hamiltonianlaceable.