Inference with path resolution and semantic graphs
Journal of the ACM (JACM)
Journal of Automated Reasoning
An Applicable Family of Data Flow Testing Criteria
IEEE Transactions on Software Engineering
TEAM: a support environment for testing, evaluation, and analysis
SDE 3 Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
On the adequacy of program dependence graphs for representing programs
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reducing the effects of infeasible paths in branch testing
TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
Automating software analysis and testing using a program transformation system
TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
The Cost of Data Flow Testing: An Empirical Study
IEEE Transactions on Software Engineering
Journal of Systems and Software
Automated Software Test Data Generation
IEEE Transactions on Software Engineering
KIDS: A Semiautomatic Program Development System
IEEE Transactions on Software Engineering
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
An investigation of the applicability of data usage analysis
Journal of Systems and Software
Test Generation from LOTOS Specifications
IEEE Transactions on Computers - Special issue on protocol engineering
A practical algorithm for exact array dependence analysis
Communications of the ACM
Test data generation and feasible path analysis
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
A Practical Decision Procedure for Arithmetic with Function Symbols
Journal of the ACM (JACM)
Theorem Proving via General Matings
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Deciding Linear Inequalities by Computing Loop Residues
Journal of the ACM (JACM)
Deciding Combinations of Theories
Journal of the ACM (JACM)
An axiomatic basis for computer programming
Communications of the ACM
RVF: An Automated Formal Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
SELECT—a formal system for testing and debugging programs by symbolic execution
Proceedings of the international conference on Reliable software
Automated Program Recognition
Plan analysis of programs
Test data generation and feasible path analysis
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Improving data-flow analysis with path profiles
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Detection of Infeasible Paths Using Presburger Arithmetic
COMPSAC '96 Proceedings of the 20th Conference on Computer Software and Applications
Improving data-flow analysis with path profiles
ACM SIGPLAN Notices - Best of PLDI 1979-1999
CONSIT: a fully automated conditioned program slicer
Software—Practice & Experience
Static and dynamic analysis of call chains in java
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Efficient path conditions in dependence graphs for software safety analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
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
Structural Testing of Component-Based Systems
CBSE '08 Proceedings of the 11th International Symposium on Component-Based Software Engineering
PSO based pseudo dynamic method for automated test case generation using interpreter
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
WCET-aware data selection and allocation for scratchpad memory
Proceedings of the 13th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, Tools and Theory for Embedded Systems
Software regression as change of input partitioning
Proceedings of the 34th International Conference on Software Engineering
Hi-index | 0.00 |
For certain structural testing criteria a significant proportion of tests instances are infeasible in the sense the semantics of the program implies that test data cannot be constructed that meet the test requirement. This paper describes the design and prototype implementation of a structural testing system that uses a theorem prover to determine feasibility of testing requirements and to optimize the number of test cases required to achieve test coverage. Using this approach, we were able to accurately and efficiently determine path feasibility for moderately-sized program units of production code written in a subset of Ada. On these problems, the computer solutions were obtained much faster and with greater accuracy than manual analysis. The paper describes how we formalize test criteria as control flow graph path expressions; how the criteria are mapped to logic formulas; and how we control the complexity of the inference task. It describes the limitations of the system and proposals for its improvement as well as other applications of the analysis.