FAABS '00 Proceedings of the First International Workshop on Formal Approaches to Agent-Based Systems-Revised Papers
How AI Can Help SE; or: Randomized Search Not Considered Harmful
AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
Symbolic interpretation and tracing of PASCAL-programs
ICSE '78 Proceedings of the 3rd international conference on Software engineering
Bandwidth Reservation in Multihop Wireless Networks: Complexity and Mechanisms
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
An objective comparison of the cost effectiveness of three testing methods
Information and Software Technology
Bandwidth-Constrained Routing Problem in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Paths and trails in edge-colored graphs
Theoretical Computer Science
Finding shortest contractible and shortest separating cycles in embedded graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the complexity of paths avoiding forbidden pairs
Discrete Applied Mathematics
The tractability of path-based inheritance
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Complexity results on labeled shortest path problems from wireless routing metrics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Finding shortest contractible and shortest separating cycles in embedded graphs
ACM Transactions on Algorithms (TALG)
Paths and trails in edge-colored graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Predicting gene structures from multiple RT-PCR tests
WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
Abductive and default reasoning: a computational core
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
On structured digraphs and program testing
IEEE Transactions on Computers
Antilope—A Lagrangian Relaxation Approach to the de novo Peptide Sequencing Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Complexity of paths, trails and circuits in arc-colored digraphs
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Mutation based test case generation via a path selection strategy
Information and Software Technology
Theoretical Computer Science
Complexity of trails, paths and circuits in arc-colored digraphs
Discrete Applied Mathematics
Complexity of the path avoiding forbidden pairs problem revisited
Discrete Applied Mathematics
Kernel bounds for path and cycle problems
Theoretical Computer Science
| Hi-index | 0.01 |
In this paper we analyze the complexity of algorithms for two problems that arise in automatic test path generation for programs: the problem of building a path through a specified set of program statements and the problem of building a path which satisfies impossible-pairs restrictions on statement pairs. These problems are both reduced to graph traversal problems. We give an efficient algorithm for the first, and show that the second is NP-complete.