The causes and effects of infeasible paths in computer programs

Authors:
D. Hedley;M. A. Hennell
Affiliations:
Liverpool Data Research Associates Ltd., Merseyside Innovation Centre, 131 Mount Pleasant, Liverpool L3 5TF, U.K.;Liverpool Data Research Associates Ltd., Merseyside Innovation Centre, 131 Mount Pleasant, Liverpool L3 5TF, U.K.
Venue:
ICSE '85 Proceedings of the 8th international conference on Software engineering
Year:
1985

Citing 4
Cited 11

Developing a Single Numerical Algorithms Library for Different Machine Ranges

ACM Transactions on Mathematical Software (TOMS)
An Approach to Program Testing

ACM Computing Surveys (CSUR)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Automated generation of testcase datasets

Proceedings of the international conference on Reliable software

Determining path feasibility for commercial programs

ACM SIGPLAN Notices
Automatic Generation of Path Covers Based on the Control Flow Analysis of Computer Programs

IEEE Transactions on Software Engineering
Towards a structural load testing tool

ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Paths between imperative and functional programming

ACM SIGPLAN Notices
Stress-Based and Path-Based Fault Injection

IEEE Transactions on Computers
Symbolic Execution of Program Paths Involving Pointer and Structure Variables

QSIC '04 Proceedings of the Quality Software, Fourth International Conference
Detecting large number of infeasible paths through recognizing their patterns

Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Heuristics-based infeasible path detection for dynamic test data generation

Information and Software Technology
An efficient method to generate feasible paths for basis path testing

Information Processing Letters
Integration testing in software product line engineering: a model-based technique

FASE'07 Proceedings of the 10th international conference on Fundamental approaches to software engineering
Testing techniques in software engineering

Testing techniques in software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

An analysis is presented of infeasible paths found in the NAG library of numerical algorithms. The construction of program paths designed to maximise structural testing measures is shown to be impossible without taking infeasibilities into account. Methods for writing programs which do not contain infeasible paths are also discussed.