Test input generation with java PathFinder

By Willem Visser, Corina S. Pasareanu, Sarfraz Khurshid. International Symposium on Software Testing and Analysis, 2004

599 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Software

View Paper: https://www.semanticscholar.org/paper/04f974fc6094da2f5337b98363333d6b564faf58

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

In Software

Citations in the corpus

Feedback-Directed Random Test Generation (2007, methodology): “Container classes have been used to evaluate many input generation techniques [18, 31, 30, 27, 28].”
Heuristics for Scalable Dynamic Test Generation (2008, methodology): “The details of the construction of the symbolic memory and constraints is standard [27, 12, 24]: at every statement l : m := INPUT(), the symbolic memory map S introduces a mappingm 7→ xm from the addressm to a fresh symbolic value xm, and at every assignment l : m := e, the symbolic memory map upda”
Hybrid Concolic Testing (2007, methodology): “The details of the construction of the symbolic memory and constraints is standard [28, 14, 25].”
CUTE: a concolic unit testing engine for C (2005, methodology): “, generate only the input memory graphs for which repOk returns true [5, 27].”
Symstra: A Framework for Generating Object-Oriented Unit Tests Using Symbolic Execution (2005, methodology): “The experimental results show that Symstra generates tests faster than the existing test-generation techniques based on exhaustive exploration of sequences with concrete method arguments [33,16,15,34].”
Whole Test Suite Generation (2013, methodology): “This is a kind of problem we faced when we tried to compare EVOSUITE with tools such as JPF [45] and TestFul [13], and which makes large empirical studies difficult.”
KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs (2008, unknown): “However, the approaches are somewhat complementary to KLEE : the tests KLEE generates can be used to drive the model checked code, similar to the approach embraced by Java PathFinder [31,37].”
DART: directed automated random testing (2005, methodology): “We now discuss how to implement the algorithms presented in the previous section for testing programs written in the C programming language.”
Compositional dynamic test generation (2007, background): “The practical implication of this simple observation is significant: static test generation as proposed by King 30 years ago and much discussed since then (e.g., see [Mye79, Edv99, BCH + 04, VPK04 , XMSN05, CS05]) is doomed to perform poorly whenever symbolic execution is not possible.”
Concolic Testing for Deep Neural Networks (2018, background): “In symbolic execution [5, 26, 32] an execution path is encoded symbolically.”