Automatically detecting and fixing concurrency bugs in go software systems

Liu, Ziheng; Zhu, Shuofei; Qin, Boqin; Chen, Hao; Song, Linhai

doi:10.1145/3445814.3446756

Cited by 15 publications

(1 citation statement)

References 84 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Atomicity allows programmers to reason about atomic blocks without worrying about the effects of other threads. Unfortunately, violation of atomicity specifications is quite common and is the root cause in a majority of real-world bugs [9,13,22,29,35,37,61].…”

Section: Introductionmentioning

confidence: 99%

Atomicity Checking in Linear Time using Vector Clocks

Mathur

Viswanathan

2020

Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Syste

View full text Add to dashboard Cite

Multi-threaded programs are challenging to write. Developers often need to reason about a prohibitively large number of thread interleavings to reason about the behavior of software. A non-interference property like atomicity can reduce this interleaving space by ensuring that any execution is equivalent to an execution where all atomic blocks are executed serially. We consider the well studied notion of conflict serializability for dynamically checking atomicity. Existing algorithms detect violations of conflict serializability by detecting cycles in a graph of transactions observed in a given execution. The number of edges in such a graph can grow quadratically with the length of the trace making the analysis not scalable. In this paper, we present AeroDrome, a novel single pass linear time algorithm that uses vector clocks to detect violations of conflict serializability in an online setting. Experiments show that AeroDrome scales to traces with a large number of events with significant speedup. CCS Concepts. • Software and its engineering → Dynamic analysis; Software testing and debugging.

show abstract

Section: Introductionmentioning

confidence: 99%

Atomicity Checking in Linear Time using Vector Clocks

Mathur

Viswanathan

2020

Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Syste

View full text Add to dashboard Cite

show abstract

Automated verification of concurrent go programs via bounded model checking

Dilley,

Lange

2023

Autom Softw Eng

View full text Add to dashboard Cite

Automated Verification of Go Programs via Bounded Model Checking

Nicolas

Lange

2021

2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE)

View full text Add to dashboard Cite

The Go programming language offers a wide range of primitives to coordinate lightweight threads, e.g., channels, waitgroups, and mutexes -all of which may cause concurrency bugs. Static checkers that guarantee the absence of bugs are essential to help programmers avoid these costly errors before their code is executed. However existing tools either miss too many bugs or cannot handle large programs. To address these limitations, we propose a static checker for Go programs which relies on performing bounded model checking of their concurrent behaviours. In contrast to previous works, our approach deals with large codebases, supports programs that have statically unknown parameters, and is extensible to additional concurrency primitives. Our work includes a detailed presentation of the extraction algorithm from Go programs to models, an algorithm to automatically check programs with statically unknown parameters, and a large scale evaluation of our approach. The latter shows that our approach outperforms the state-of-the-art. 1 func preload(trees []string, n int) { 2 ch := make(chan string, n) // new chan with capacity n 3 limitCh := make(chan int, runtime.NumCPU()) 4 for i := 0; i < runtime.NumCPU(); i++ { 5 limitCh <-1 // send token on chan limitCh 6 } 7 var wg sync.WaitGroup 8 for _, t := range trees { 9 wg.Add(1) // increment wg counter 10 go func(v string) { // spawn goroutine 11 <-limitCh // receive token before starting work 12 s := DoSomeWork(v) 13 ch <-s 14 limitCh <-1 // return token 15 wg.Done() // decrement wg counter 16 }(t) 17 } 18 go func() { // spawn goroutine 19 wg.Wait() // wait for wg to reach 0 20 close(ch) // set ch to closed 21 }() 22 for s := range ch { // receive message from ch 23 if IsError(s) { 24

show abstract

Automatically detecting and fixing concurrency bugs in go software systems

Cited by 15 publications

References 84 publications

Atomicity Checking in Linear Time using Vector Clocks

Atomicity Checking in Linear Time using Vector Clocks

Automated verification of concurrent go programs via bounded model checking

Automated Verification of Go Programs via Bounded Model Checking

Contact Info

Product

Resources

About