CPL - Chalmers Publication Library

Finding Race Conditions in Erlang with Quick Check and PULSE

Författare och institution:
Koen Claessen (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)); Michal H. Palka (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)); Nicholas Smallbone (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)); John Hughes (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)); Hans Svensson (Institutionen för data- och informationsteknik (Chalmers)); Thomas Arts (Institutionen för data- och informationsteknik (Chalmers)); U. Wiger (-)
Publicerad i:
ICFP'09: Proceedings of the ACM SIGPLAN International Conference on Functional Programming, s. 149-160
Konferensbidrag, refereegranskat
Fulltextlänk (lokalt arkiv):
Sammanfattning (abstract):
We address the problem of testing and debugging concurrent, distributed Erlang applications. In concurrent programs, race conditions are a common class of bugs and are very hard to find in practice. Traditional unit testing is normally unable to help finding all race conditions, because their occurrence depends so much on timing. Therefore, race conditions are often found during system testing, where due to the vast amount of code under test, it is often hard to diagnose the error resulting from race conditions. We present three tools (Quick Check, PULSE, and a visualizer) that in combination can be used to test and debug concurrent programs in unit testing with a much better possibility of detecting race conditions. We evaluate our method on an industrial concurrent case study and illustrate how we find and analyze the race conditions.
Ämne (baseras på Högskoleverkets indelning av forskningsämnen):
Data- och informationsvetenskap ->
Medieteknik ->
Information Technology
Quick Check, Race Conditions, Erlang
Postens nummer:
Ingår i post nr:
Posten skapad:
2010-08-26 15:58
Posten ändrad:
2013-09-28 05:02

Visa i Endnote-format