CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Finding race conditions in erlang with quickcheck and PULSE

Koen Claessen (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; Michał Pałka ; 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, Programvaruteknik (Chalmers)) ; Thomas Arts (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; Ulf Wiger
ACM SIGPLAN Notices (15232867). Vol. 44 (2009), 9, p. 149-160.
[Artikel, refereegranskad vetenskaplig]

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 (QuickCheck, 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.

Nyckelord: Erlang; Quickcheck; Race conditions



Denna post skapades 2017-12-01.
CPL Pubid: 253486

 

Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers) (2008-2010)

Ämnesområden

Data- och informationsvetenskap

Chalmers infrastruktur