Linaro Connect 24
LIS25-124 Finding Locking Bugs With Static Analysis Using Smatch
Unknown
- Wednesday, 14 May 12:30 - 12:55
- Room: Keynote room | Floriana II
In past talks I've often talked about how to write this simplest possible static check. This talk will be the opposite. The Smatch check for locking bugs is the oldest, largest and most complicated check. I have re-written this check since the last Linaro Connect. This talk will cover how to write a very complicated check and some of the lessons learned.
Presented by
Dan Carpenter
Software Engineer at Linaro
Dan Carpenter has worked on static analysis for 15 years. He lives in Africa and was once almost eaten by a leopard. View more
Software Engineer at Linaro
Dan Carpenter has worked on static analysis for 15 years. He lives in Africa and was once almost eaten by a leopard. View more