Automated test case generation with SMT-solving and abstract interpretation

Authors:
Jan Peleska;Elena Vorobev;Florian Lapschies
Affiliations:
Department of Mathematics and Computer Science, University of Bremen, Germany;Department of Mathematics and Computer Science, University of Bremen, Germany;Department of Mathematics and Computer Science, University of Bremen, Germany
Venue:
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Year:
2011

Citing 6
Cited 3

The STATEMATE semantics of statecharts

ACM Transactions on Software Engineering and Methodology (TOSEM)
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts

Proceedings of the 46th Annual Design Automation Conference
Deciding bit-vector arithmetic with abstraction

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Combination of abstractions in the ASTRÉE static analyzer

ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
On solving the partial MAX-SAT problem

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

A real-world benchmark model for testing concurrent real-time systems in the automotive domain

ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
Translation validation for a verified OS kernel

Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Comprehensive formal verification of an OS microkernel

ACM Transactions on Computer Systems (TOCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe an approach for automated modelbased test case and test data generation based on constraint types well known from bounded model checking. Our main contribution consists of a demonstration showing how this process can be considerably accelerated by using abstract interpretation techniques for preliminary explorations of the model state space. The techniques described support models for concurrent synchronous reactive systems under test with clocks and dense-time.