As far as I know, SpeC # from Microsoft Research is the most powerful static DbC language yet . It uses a powerful static analysis tool called Boogie , which in turn uses a powerful probe for checking the theorem / Constraint Solver, called Z3 , to prove the fulfillment or violation of contracts during development.
If the proof of the theorem can prove that the contract will always be violated, this is a compilation error. If the probe of the theorem can prove that the contract will never be broken, then optimization: contract checks are removed from the final DLL.
As Charlie Martin points out, proving contracts is generally equivalent to solving the stop problem, and therefore impossible. Thus, there will be many cases when the theoretician can neither prove nor disprove the contract. In this case, a runtime check is issued, as in other, less powerful contract systems.
Please note that Spe # is no longer being developed. The contract mechanism was extracted to a library called Code Contracts for.NET , which will be part of .NET 4.0 / Visual Studio 2010. However, language support for contracts will not.