Is it possible in theory to prove using a static analysis tool that Java code has no race conditions?
Regardless of what static analysis tools available on the market, is it possible in theory to prove using a static analysis tool that Java (or any other imperative language) code has no race conditions?
Is it possible in theory to prove using a static analysis tool that Java code has no race conditions?
===

Regardless of what static analysis tools available on the market, is it possible in theory to prove using a static analysis tool that Java (or any other imperative language) code has no race conditions?