TU Darmstadt / ULB / TUbiblio

Bita: Coverage-Guided, Automatic Testing of Actor Programs

Tasharofi, Samira and Pradel, Michael and Lin, Yu and Johnson, Ralph (2013):
Bita: Coverage-Guided, Automatic Testing of Actor Programs.
In: 2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE), IEEE Computer Society, Palo Alto, CA, USA, ISBN 978-1-4799-0215-6/13,
DOI: 10.1109/ASE.2013.6693072,
[Conference or Workshop Item]

Abstract

Actor programs are concurrent programs where concurrent entities communicate asynchronously by exchanging messages. Testing actor programs is challenging because the order of message receives depends on the non-deterministic scheduler and because exploring all schedules does not scale to large programs. This paper presents Bita, a scalable, automatic approach for testing non-deterministic behavior of actor programs. The key idea is to generate and explore schedules that are likely to reveal concurrency bugs because these schedules increase the schedule coverage. We present three schedule coverage criteria for actor programs, an algorithm to generate feasible schedules that increase coverage, and a technique to force a program to comply with a schedule. Applying Bita to real-world actor programs implemented in Scala reveals eight previously unknown concurrency bugs, of which six have already been fixed by the developers. Furthermore, we show our approach to find bugs 122× faster than random scheduling, on average.

Item Type: Conference or Workshop Item
Erschienen: 2013
Creators: Tasharofi, Samira and Pradel, Michael and Lin, Yu and Johnson, Ralph
Title: Bita: Coverage-Guided, Automatic Testing of Actor Programs
Language: German
Abstract:

Actor programs are concurrent programs where concurrent entities communicate asynchronously by exchanging messages. Testing actor programs is challenging because the order of message receives depends on the non-deterministic scheduler and because exploring all schedules does not scale to large programs. This paper presents Bita, a scalable, automatic approach for testing non-deterministic behavior of actor programs. The key idea is to generate and explore schedules that are likely to reveal concurrency bugs because these schedules increase the schedule coverage. We present three schedule coverage criteria for actor programs, an algorithm to generate feasible schedules that increase coverage, and a technique to force a program to comply with a schedule. Applying Bita to real-world actor programs implemented in Scala reveals eight previously unknown concurrency bugs, of which six have already been fixed by the developers. Furthermore, we show our approach to find bugs 122× faster than random scheduling, on average.

Title of Book: 2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE)
Publisher: IEEE Computer Society
ISBN: 978-1-4799-0215-6/13
Uncontrolled Keywords: Schedules, Receivers, Concurrent computing, Computer bugs, Testing, Programming, Postal services
Divisions: Profile Areas > Cybersecurity (CYSEC)
Profile Areas
Event Location: Palo Alto, CA, USA
Date Deposited: 28 Aug 2017 12:46
DOI: 10.1109/ASE.2013.6693072
Identification Number: TUD-CS-2013-0481
Export:
Suche nach Titel in: TUfind oder in Google

Optionen (nur für Redakteure)

View Item View Item