Abstraction and mining of traces to explain concurrency bugs

DOI10.1007/S10703-015-0240-5zbMath1380.68107DBLPjournals/fmsd/BefroueiWW16OpenAlexW2235911515WikidataQ55670636 ScholiaQ55670636MaRDI QIDQ681463

Georg Weissenbacher, Mitra Tabaei Befrouei, Chao Wang

Publication date: 12 February 2018

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-015-0240-5

zbMATH Keywords

learningpattern miningfault localizationbug explanationconcurrency bugs

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Abstraction and mining of traces to explain concurrency bugs

Uses Software

• Eraser
• RacerX
• Goldilocks
• PrefixSpan
• CTrigger
• bzip2smp
• FastTrack
• Falcon
• CHESS
• AVIO
• CloSpan
• BIDE

Cites Work

• Abstraction and mining of traces to explain concurrency bugs
• The serializability of concurrent database updates
• Unnamed Item
• Unnamed Item

This page was built for publication: Abstraction and mining of traces to explain concurrency bugs