Test data generation and feasible path analysis

Jasper, Robert; Brennan, Mike; Williamson, Keith; Currier, Bill; Zimmerman, D. C.

doi:10.1145/186258.187150

Cited by 50 publications

(25 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many researchers have been done for identifying the infeasible paths of a program [11]. Different algorithms and techniques have been proposed by the researchers to detect optimized paths [12,13].Generating test data automatically and identifying infeasible paths reduces the testing cost, time and effort [14].…”

Section: Software Testingmentioning

confidence: 99%

Test Cost Optimization Using Tabu Search

Sharma¹,

Jadhav²,

Srivastava³

et al. 2010

JSEA

View full text Add to dashboard Cite

show abstract

Section: Software Testingmentioning

confidence: 99%

Test Cost Optimization Using Tabu Search

Sharma¹,

Jadhav²,

Srivastava³

et al. 2010

JSEA

View full text Add to dashboard Cite

show abstract

“…Jasper et al [8] use weakest precondition computation to generate test cases especially tailored for a complex coverage criterion in single threaded ADA programs. Rather than augmenting the model, they generate axioms describing the program and use a theorem prover to compute its feasibility.…”

Section: Related Workmentioning

confidence: 99%

“…For the formal specification of test purposes we use assertions which express required properties of the object state (or a suitable abstraction thereof). Test cases are then generated by applying a weakest precondition calculus in order to find an abstract behavior which satisfies the assertions [8]. The execution of a test case on the Maude platform requires instrumenting the Maude interpreter of Creol's operational semantics such that it will enforce the embodied scheduling policy on the processes of the particular concurrent object which is considered by the test case.…”

Section: Introductionmentioning

confidence: 99%

Testing Concurrent Objects with Application-Specific Schedulers

Schlatte

Aichernig

Boer

et al. 2008

Theoretical Aspects of Computing - ICTAC 2008

View full text Add to dashboard Cite

Abstract. In this paper, we propose a novel approach to testing executable models of concurrent objects under application-specific scheduling regimes. Method activations in concurrent objects are modeled as a composition of symbolic automata; this composition expresses all possible interleavings of actions. Scheduler specifications, also modeled as automata, are used to constrain the system execution. Test purposes are expressed as assertions on selected states of the system, and weakest precondition calculation is used to derive the test cases from these test purposes. Our new testing technique is based on the assumption that we have full control over the (application-specific) scheduler, which is the case in our executable models under test. Hence, the enforced scheduling policy becomes an integral part of a test case. This tackles the problem of testing non-deterministic behavior due to scheduling.

show abstract

“…For validation and verification purposes, this formal specification can then be subjected to various types of analysis, for example, completeness and consistency analysis [17,19] model checking [15,9,10,20,11], theorem proving [1,2], and test case generation [8,14,13,4,28,21,30]. Through manual inspections, formal verification, and simulation and testing we convince ourselves (and any regulatory agencies) that the software specification possesses desired properties.…”

Section: Model-based Developmentmentioning

confidence: 99%

A Case for Specification Validation

Heimdahl

2008

Verified Software: Theories, Tools, Experiments

View full text Add to dashboard Cite

Abstract. As we are moving from a traditional software development process to a new development paradigm where the process it largely driven by tools and automation, new challenges for verification and validation (V&V) emerge. Productivity improvements will in this new paradigm be achieved through reduced emphasis on testing of implementations, increased reliance on automated analysis tools applied in the specification domain, verifiability correct generation of source-code, and verifiably correct compilation. The V&V effort will now be largely focused on assuring that the formal specifications are correct and that the tools are trustworthy so we can rely on the results of the analysis and code generation without extensive additional testing of the resulting implementation. Most effort has traditionally been devoted to the verification problem. In this position paper we point out the importance of validation and argue that if we fail to adequately address the validation problem problem the impact of verifying code generation and compilation will be limited.

show abstract

Test data generation and feasible path analysis

Cited by 50 publications

References 16 publications

Test Cost Optimization Using Tabu Search

Test Cost Optimization Using Tabu Search

Testing Concurrent Objects with Application-Specific Schedulers

A Case for Specification Validation

Contact Info

Product

Resources

About