Finding Concurrency-Related Bugs Using Random Isolation

DOI10.1007/978-3-540-93900-9_18MaRDI QIDQ3600476zbMATH OpenOpenAlexFDO

Authors Nicholas Kidd, Julian Dolby, Mandana Vaziri, Thomas Reps

Publication date 10 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.143.5842

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Meta-analysis for Atomicity Violations under Nested Locking
• Framework for testing multi‐threaded Java programs
• On interference abstractions
• Monitoring Atomicity in Concurrent Programs
• Abstraction and mining of traces to explain concurrency bugs

Cited in

(4)

• Finding race conditions in Erlang with quickcheck and PULSE
• Meta-analysis for Atomicity Violations under Nested Locking
• Framework for testing multi‐threaded Java programs
• Abstraction and mining of traces to explain concurrency bugs

Describes a project that uses

Uses Software

• Eraser
• TVLA
• MAGIC

This page was built for publication: Finding Concurrency-Related Bugs Using Random Isolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600476)