Applications of symbolic evaluation
Journal of Systems and Software
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
A practical algorithm for exact array dependence analysis
Communications of the ACM
Applications of feasible path analysis to program testing
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Test data generation and feasible path analysis
ISSTA '94 Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM (JACM)
Symbolic execution and program testing
Communications of the ACM
TPCD '94 Proceedings of the Second International Conference on Theorem Provers in Circuit Design - Theory, Practice and Experience
A System to Generate Test Data and Symbolically Execute Programs
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Detecting infeasible paths (IFPs) allows accurate computation of various kinds of program slices, and accurate detection of semantic errors that may occur when two variants of a program are merged. We propose a method of efficiently determining the truth of a prenex normal form Presburger sentence (P-sentence) bounded only by existential quantifiers, which is suitable for detecting IFPs. In this method, a coefficients matrix is converted into a triangular matrix based on the method proposed by D.C. Cooper. If the rank of the matrix is lower than the degree of the matrix, the matrix is triangulated by using a method for solving one linear equation with three or more unknowns, so that the matrix can be back-substituted. This paper also reports that an implementation of our method shows a slower increase in computation time than the previous method and reduces computation time by up to 3,000,000 times.