J. C. King. Symbolic execution and program testing. Commun. ACM, 19(7):385--394, 1976. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Automatic Test Data Generation for Programs with Integer and.. - Sy, Deville (2001) (Correct)
....by first selecting a set of paths that covers all the statements satisfying a given criterion and then generating a test input which executes each selected path. These approaches include, among others, symbolic evaluation and program execution based test data generation. Symbolic evaluation [Kin76] consists in replacing input variables by symbolic values. It then derives path constraints over these symbolic values, forming a constraint system describing conditions under which a path is traversed. The constraints are then symbolically solved. Although symbolic evaluation is promising, it ....
J.C. King. Symbolic Execution and Program Testing. Communications of the ACM, 19(7):385--394, July 1976.
Generalized Symbolic Execution for Model Checking and.. - Khurshid, Pasareanu, Visser (2003) (8 citations) (Correct)
....reactive systems. A drawback of model checking is that it su ers from the statespace explosion problem and typically requires a closed system, i.e. a system together with its environment, and a bound on input sizes [4, 6, 9, 19] We present a novel framework based on symbolic execution [14], which automates test case generation, allows model checking concurrent programs that take inputs from unbounded domains with complex structure, and helps combat state space explosion. Symbolic execution is a well known program analysis technique, which represents values of program variables with ....
....a precondition that the input list should be acyclic, the analysis does not consider the three executions (Figure 1) where the input has a cycle. The input structures and constraints can be used for test input generation. 3 Background: Symbolic execution The main idea behind symbolic execution [14] is to use symbolic values, instead of actual data, as input values, and to represent the values of program variables as symbolic expressions. As a result, the output values computed by a program are expressed as a function of the input symbolic values. The state of a symbolically executed ....
[Article contains additional citation context not shown here]
J. C. King. Symbolic execution and program testing. Communications of the ACM, 19(7):385-394, 1976.
Experiments with Test Case Generation and Runtime.. - Artho, Drusinksy.. (2003) (Correct)
.... model based testing is typically a model of expected system behavior and can be derived from a number of sources, namely, a model of the requirements, use cases, design specifications of a system [12] even the code itself can be used to create a model (e.g. symbolic execution based approaches [19,21]) As with the dynamic approach, it is most typical to use some notion of coverage of the model to derive test inputs, i.e. generate inputs that cover all transitions (or branches, etc. in the model. To construct a model of the expected system behavior can, however, be a costly process. On the ....
J. C. King. Symbolic Execution and Program Testing. Communications of the ACM, 19(7):385-394, 1976.
Program Slicing: Methods and Applications - De Lucia (2001) (16 citations) (Correct)
....be specified to obtain any form of slice. A conditioned slice can be computed by first simplifying the program with respect to the condition on the input (i.e. discarding infeasible paths with respect to the input condition) and then computing a slice on the reduced program. A symbolic executor [53, 24] can be used to compute the reduced program, also called conditioned program in [15] Although the identification of the infeasible paths of a conditioned program is in general an undecidable problem, in most cases implications between conditions can be automatically evaluated by a theorem prover, ....
J.C. King, "Symbolic execution and program testing", Communications of the ACM, vol. 19, no. 7, 1976, pp. 385-394.
Automatically Detecting Equivalent Mutants and Infeasible Paths - Offutt, Pan (1997) (Correct)
....to be satisfied. Constraints are originally created using the variables that occur in the program text. Unfortunately, this includes variables that are internal to the program, that is, variables that are not given values as part of the test case. For test case generation, symbolic evaluation [Kin76, Off91] is used to rewrite the variables to be in terms of input variables. 2.4 Strategies for Detecting Equivalent Mutants The general strategy for detecting equivalent mutants is to find contradictions in the constraint systems. Because recognizing infeasible constraint systems is generally ....
J. C. King. Symbolic execution and program testing. Communications of the ACM, 19(7):385--394, July 1976.
A Fortran Language System for Mutation-based Software Testing - King, Offutt (1991) (23 citations) Self-citation (King) (Correct)
No context found.
J. C. King, `Symbolic execution and program testing', Communications of the ACM, 19, (7), 385--394 (1976).
Modular Verification of Code with SAT - Greg Dennis Felix (2006) (Correct)
No context found.
J. C. King. Symbolic execution and program testing. Commun. ACM, 19(7):385--394, 1976.
Program Verification By Calculating Relations - Jacques Carette Ryszard (Correct)
No context found.
J. C. King, Symbolic Execution and program testing. Communications of the ACM, pages 385--394, July 1976.
Unknown - (Correct)
No context found.
James C. King. Symbolic execution and program testing. Communications of the ACM, 19(7):385--394, 1976.
Generating Tests from Counterexamples - Beyer, Chlipala, Henzinger.. (2004) (6 citations) (Correct)
No context found.
J. King. Symbolic execution and program testing. Comm. ACM, 19:385--394, 1976.
Search-based Software Test Data Generation: A Survey - McMinn (2004) (Correct)
No context found.
J. King. Symbolic execution and program testing. Communications of the ACM, 19(7):385--394, 1976.
Experiments with Test Case Generation and Runtime.. - Artho, Drusinsky.. (2003) (Correct)
No context found.
J. C. King. Symbolic Execution and Program Testing. Communications of the ACM, 19(7):385394, 1976.
Test Input Generation with Java PathFinder - Visser, Pasareanu, Khurshid (Correct)
No context found.
J. C. King. Symbolic execution and program testing. Commun. ACM, 19(7):385--394, 1976.
Evolutionary Testing in the Presence of Loop-Assigned Flags.. - Baresel, Harman (2004) (2 citations) (Correct)
No context found.
J. C. King. Symbolic execution and program testing. Communications of the ACM, 19(7):385--394, July 1976.
Light-Weight Theorem Proving for Debugging and Verifying.. - Deharbe, Ranise (2003) (2 citations) (Correct)
No context found.
J. C. King. Symbolic Execution and Program Testing. Comm. ACM, 19(7):385--394, 1976.
ConSUS: A Light-Weight Program Conditioner - Sebastian Danicic Mohammed (2004) (Correct)
No context found.
J. C. King, Symbolic execution and program testing, Communications of the ACM 19 (7) (1976) 385--394.
Generating Tests from Counterexamples - Beyer, Chlipala, Henzinger.. (2004) (6 citations) (Correct)
No context found.
J. King. Symbolic execution and program testing. Comm. ACM, 19:385--394, 1976.
Generating Tests from Counterexamples - Beyer, Chlipala, Henzinger.. (2004) (6 citations) (Correct)
No context found.
J. King. Symbolic execution and program testing. Comm. ACM, 19:385--394, 1976.
Building Executable Union Slices using Conditioned Slicing - Danicic, De Lucia, Harman (2004) (Correct)
No context found.
J. C. King. Symbolic execution and program testing. Communications of the ACM, 19(7):385--394, July 1976.
Verification of Java Programs using Symbolic Execution and.. - Pasareanu, Visser (2004) (Correct)
No context found.
J. C. King. Symbolic execution and program testing. Commun. ACM, 19(7):385{ 394, 1976.
The Spec# Programming System: An Overview - Barnett, Leino, Schulte (Correct)
No context found.
James C. King. Symbolic execution and program testing. Communications of the ACM, 19(7):385--394, July 1976.
Evolutionary Testing in the Presence of Loop-Assigned Flags.. - Baresel, Harman (2004) (2 citations) (Correct)
No context found.
J. C. King. Symbolic execution and program testing. Communications of the ACM, 19(7):385--394, July 1976.
Consistency Techniques for Interprocedural Test Data Generation - Sy, Deville (2003) (1 citation) (Correct)
No context found.
J. King. Symbolic Execution and Program Testing. Communications of the ACM, 19(7):385--394, July 1976.
Fast Symbolic Evaluation of C/C++ Preprocessing Using.. - Mario Latendresse Ngit (Correct)
No context found.
J. C. King. Symbolic execution and program testing. Communications of the ACM, 19(7):385--394, July 1976.
Generalized Symbolic Execution for Model Checking and.. - Khurshid, Pasareanu, Visser (2003) (8 citations) (Correct)
No context found.
J. C. King. Symbolic execution and program testing. Communications of the ACM, 19(7):385--394, 1976.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC