Test case generation for object-oriented imperative languages in CLP

DOI10.1017/S1471068410000347zbMATH Open1209.68093arXiv1007.5195OpenAlexW2130318821MaRDI QIDQ3585175FDOQ3585175

Authors: Miguel Gómez-Zamalloa, Elvira Albert, Germán Puebla 

Publication date: 19 August 2010

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Abstract: Testing is a vital part of the software development process. Test Case Generation (TCG) is the process of automatically generating a collection of test cases which are applied to a system under test. White-box TCG is usually performed by means of symbolic execution, i.e., instead of executing the program on normal values (e.g., numbers), the program is executed on symbolic values representing arbitrary values. When dealing with an object-oriented (OO) imperative language, symbolic execution becomes challenging as, among other things, it must be able to backtrack, complex heap-allocated data structures should be created during the TCG process and features like inheritance, virtual invocations and exceptions have to be taken into account. Due to its inherent symbolic execution mechanism, we pursue in this paper that Constraint Logic Programming (CLP) has a promising unexploited application field in TCG. We will support our claim by developing a fully CLP-based framework to TCG of an OO imperative language, and by assessing it on a corresponding implementation on a set of challenging Java programs. A unique characteristic of our approach is that it handles all language features using only CLP and without the need of developing specific constraint operators (e.g., to model the heap).

Full work available at URL: https://arxiv.org/abs/1007.5195

Recommendations

• Towards a framework for constraint-based test case generation
• A framework for guided test case generation in constraint logic programming
• A CLP heap solver for test case generation
• Efficient generation of test data structures using constraint logic programming and program transformation
• A Novel Test Case Generation Method for Prolog Programs Based on Call Patterns Semantics

zbMATH Keywords

constraint logic programmingsymbolic executiontest case generation

Mathematics Subject Classification ID

Logic programming (68N17) Theory of software (68N99)

Cites Work

• Symbolic execution and program testing
• Automatic software model checking via constraint logic
• Test Data Generation of Bytecode by CLP Partial Evaluation
• Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates

Cited In (15)

• A framework for computing finite SLD trees
• An integrated approach to assertion-based random testing in Prolog
• Analysis and Transformation of Constrained Horn Clauses for Program Verification
• Towards axiom-based test generation in .NET applications
• Tools and Algorithms for the Construction and Analysis of Systems
• Efficient generation of test data structures using constraint logic programming and program transformation
• A CLP heap solver for test case generation
• A Novel Test Case Generation Method for Prolog Programs Based on Call Patterns Semantics
• Towards a framework for constraint-based test case generation
• Concolic testing in logic programming
• Towards testing concurrent objects in CLP
• A framework for guided test case generation in constraint logic programming
• Test Data Generation of Bytecode by CLP Partial Evaluation
• Test case generation of actor systems
• Resource-Driven CLP-Based Test Case Generation

Uses Software

• Pex
• ATGen

This page was built for publication: Test case generation for object-oriented imperative languages in CLP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3585175)