RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Model. Anal. Inform. Sist.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Model. Anal. Inform. Sist., 2014, Volume 21, Number 6, Pages 83–93 (Mi mais414)  

Using a bounded model checker for test generation: how to kill two birds with one SMT-solver

Maxim Petrov, Kirill Gagarski, Mikhail Belyaev, Vladimir Itsykson

Saint-Petersburg State Polytechnic University, Polytechnicheskaya street, 29, Saint-Petersburg 195251 Russia

Abstract: The automated test generation has received a lot of attention in the last decades as it is one of possible solutions to software testing inherent problems: the need to write tests and providing test coverage in presence of human factor. The most promising technique of generating a test automatically is the dynamic symbolic execution assisted by an automated constraint solver, e. g., an SMT-solver. This process is very similar to the bounded model checking, which also has to deal with generating models from a source code, asserting logic properties in it and process the returned model. This paper describes a prototype unit test generator for C based on a working bounded model checker called Borealis and shows that these two techniques are very similar and can be easily implemented by using the same basic components. The prototype test generator was sampled on a number of examples and showed good results in terms of test coverage and test excessiveness.

Keywords: automated test generation, dynamic symbolic execution, bounded model checking, satisfiability modulo theories, function contracts.

Full text: PDF file (182 kB)
References: PDF file   HTML file
UDC: 004.054+004.4'23
Received: 15.09.2014

Citation: Maxim Petrov, Kirill Gagarski, Mikhail Belyaev, Vladimir Itsykson, “Using a bounded model checker for test generation: how to kill two birds with one SMT-solver”, Model. Anal. Inform. Sist., 21:6 (2014), 83–93

Citation in format AMSBIB
\Bibitem{PetGagBel14}
\by Maxim~Petrov, Kirill~Gagarski, Mikhail~Belyaev, Vladimir~Itsykson
\paper Using a bounded model checker for test generation: how to kill two birds with one SMT-solver
\jour Model. Anal. Inform. Sist.
\yr 2014
\vol 21
\issue 6
\pages 83--93
\mathnet{http://mi.mathnet.ru/mais414}


Linking options:
  • http://mi.mathnet.ru/eng/mais414
  • http://mi.mathnet.ru/eng/mais/v21/i6/p83

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Моделирование и анализ информационных систем
    Number of views:
    This page:348
    Full text:72
    References:23

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020