Automated test case generation with SMT-solving and abstract interpretation

62Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we describe an approach for automated model-based 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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Peleska, J., Vorobev, E., & Lapschies, F. (2011). Automated test case generation with SMT-solving and abstract interpretation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6617 LNCS, pp. 298–312). https://doi.org/10.1007/978-3-642-20398-5_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free