Your timezone:
Wednesday, 14 May 12:30 - 12:55
(Europe/Lisbon)
Session room 2 | Opala I & 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.
About
Dan Carpenter has worked on static analysis for 15 years. He lives in Africa and was once almost eaten by a leopard.