Integrating Verification and Testing of Object-Oriented Software

Engel, Christian; Gladisch, Christoph; Klebanov, Vladimir; Rümmer, Philipp

doi:10.1007/978-3-540-79124-9_13

Cited by 6 publications

(12 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The banking software contains Jml specifications with quantified formulas. When applying KeY's test generation techniques [16,22,23], the quantified formulas are encountered as test data constraints. The algorithm ensures that test data are generated only for those constraints that are satisfiable, i.e.…”

Section: Discussionmentioning

confidence: 99%

“…The KeYsystem [3,28] is a verification and test generation tool for JAVA. The tool can automatically generate JUnit tests from proof structures [16]. Figure 2 shows the components of the test generator.…”

Section: Verification-based Test Generationmentioning

confidence: 99%

“…Prominent examples of such formal techniques are symbolic execution, theorem proving, satisfiability solving, and the usage of formal specifications and program annotations such as loop and class invariants. On the other hand, several formal verification tools have been extended to generate tests based on unproved verification conditions [6,10,16,38]. The resulting formal testing techniques can achieve a high code coverage or they can generate a low number of tests that very likely exhibit software faults.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Model generation for quantified formulas with application to test data generation

Gladisch

2012

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

We present a new model generation approach and technique for solving first-order logic (FOL) formulas with quantifiers in unbounded domains. Model generation is important, e.g., for test data generation based on test data constraints and for counterexample generation in formal verification. In such scenarios, quantified FOL formulas have to be solved stemming, e.g., from formal specifications. Satisfiability modulo theories (SMT) solvers are considered as the state-of-the-art techniques for generating models of FOL formulas. Handling of quantified formulas in the combination of theories is, however, sometimes a problem. Our approach addresses this problem and can solve formulas that were not solvable before using SMT solvers. We present the model generation algorithm and show how to convert a representation of a model into a test preamble for state initialization with test data. A prototype of this algorithm is implemented in the formal verification and test generation tool KeY.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Verification-based Test Generationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Model generation for quantified formulas with application to test data generation

Gladisch

2012

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

show abstract

“…Failing verification attempts do not necessarily imply a fault in the program. To help the user in finding the cause of a failure, some verification tools have extensions for test case generation, e.g., (Deng et al 2007;Engel et al 2008;Smaragdakis and Csallner 2007). Such VBT techniques use rich information about the program gained from the verification process.…”

Section: Verification-based Testingmentioning

confidence: 99%

“…However, in contrast to traditional approaches, VBT checks more complex properties as they can be expressed in first-order logic and the code coverage achieved by VBT is higher. The VBT technique described in Engel et al (2008) and Engel and Hähnle (2007) generates test suites that are used in KeY (see Sect. 5).…”

Section: Verification-based Testingmentioning

confidence: 99%

KeYGenU: combining verification-based and capture and replay techniques for regression unit testing

Beckert

Gladisch

Tyszberowicz

et al. 2011

Int J Syst Assur Eng Manag

Self Cite

View full text Add to dashboard Cite

Unit testing plays a major role in the software development process. Two essential criteria to achieve effective unit testing are: (1) testing each unit in isolation from other parts of the program and (2) achieving high code coverage. The former requires a lot of extra work such as writing drivers and stubs, whereas the latter is difficult to achieve when manually writing the tests. When changing existing code it is advocated to run the unit tests to avoid regression bugs. However, in many cases legacy software has no unit tests. Writing those tests from scratch is a hard and tedious process, which might not be costeffective. This paper presents a tool chain approach that combines verification-based testing (VBT) and capture and replay (CaR) test generation methods. We have built a concrete tool chain, KeYGenU, which consists of two existing tools-KeY and GenUTest. The KeY system is a deductive verification and test-generation tool. GenUTest automatically generates JUnit tests for a correctly working software. This combination provides isolated unit test suites with high code-coverage. The generated tests can also be used for regression testing.

show abstract

Could We Have Chosen a Better Loop Invariant or Method Contract?

Gladisch

2009

Tests and Proofs

View full text Add to dashboard Cite

Integrating Verification and Testing of Object-Oriented Software

Cited by 6 publications

References 7 publications

Model generation for quantified formulas with application to test data generation

Model generation for quantified formulas with application to test data generation

KeYGenU: combining verification-based and capture and replay techniques for regression unit testing

Could We Have Chosen a Better Loop Invariant or Method Contract?

Contact Info

Product

Resources

About