https://runtimeverification.com/match/
https://trust-in-soft.com/products/
The RTV people are the one's behind K framework and an executable semantics for C with a GCC-like interface:
http://www.kframework.org/index.php/Main_Page
https://github.com/kframework/c-semantics
That RV-Match builds on an open framework, does well on benchmarks (yeah skepticism here), and has little to no noise (most important) is what I like most about it. I say most important since digging through false positives makes developers not want to use a tool. I haven't tried either product myself, though.
Here's a list of open tools that did well in small-scale experiments with and without false positives:
https://cseweb.ucsd.edu/~rjhala/blast.html
http://cppcheck.sourceforge.net/#features
https://github.com/kframework/c-semantics
https://runtimeverification.com/match/
Exactly what I’d hoped someone would do. Well, the first step anyway. The second step was doing a Rust semantics in terms of the C semantics already done. That allows quite a few things like Rust-to-C compilers, defeating Karger-Thompson attack, and potentially verification of interactions of Rust and C FFI code. On my end down the line, also use of C tooling for verification of equivalent Rust code.
https://github.com/kframework/c-semantics
https://runtimeverification.com/match/
They also have an article comparing it to Tis-interpreter here:
https://runtimeverification.com/blog/?p=307
Their K has been used for languages from Scheme to Prolog to C. More recently, they also did a semantics for a VM for smart contracts. They're doing a lot of interesting stuff. Builds on Maude and rewriting logic if anyone is curious.
What makes me bring K up more than some tools is that the rewriting/equational tools such as Maude [4] and K (originally done on Maude) get a lot less attention than HOL or Coq. That's despite their model making some kinds of verifications really easy in comparison to how people typically use the others. Anyone wanting to play with a different style of formal method might want to check out Maude and/or K. Rosu also keeps a list of project ideas for K, the simplest being a new language. Rust or Nim with a translator to their C semantics would be a nice one with a lot of benefits on the language using K's tools or output using C-oriented tools.
[1] http://www.kframework.org/index.php/Main_Page
[2] https://github.com/kframework/c-semantics
[3] https://runtimeverification.com/match/1.0-SNAPSHOT/docs/benc...
[4] http://maude.cs.illinois.edu/w/index.php?title=The_Maude_Sys...
Note on title: Changed it to indicate what part of the work stands out a bit since there's too many blockchain languages and VM's to track at this point. People who'd like the capabilities for blockchains or a totally-unrelated use-case might filter prematurely with original title.
In fact, C0 is explicitly targeted at computer scientists rather than engineers.
http://www.kframework.org/index.php/Main_Page
More interesting, their use of these tools allowed them to make their C semantics executable in a style similar to GCC:
https://github.com/kframework/c-semantics
I want this group to do one for Rust and SPARK as a reference spec for certifying compilers for those. Also useful for the diverse compilation concept to counter Karger's compiler/compiler subversion. On a side note, they also have a company that they use to fund and apply their work:
https://www.cl.cam.ac.uk/~mom22/
This data structure refinement with one version getting automated to a large degree:
https://www21.in.tum.de/~lammich/pub/cpp2016_impds.pdf
Thanks to DeepSpec, Coq might exceed that in some ways:
Note that a lot of work around Coq goes through CompCert which is proprietary software with restrictions on how it's used if one doesn't pay. The Isabelle/HOL alternatives like Simpl/C and CakeML are free software. Then, outside those two, we got a bunch of work being done in Maude (esp K Framework) with one an executable, formal semantics for C done like a compiler:
Afaik, kcc is also really good at finding undefined behavior. Regehr even wrote about it in the past (https://blog.regehr.org/archives/523).
BTW, both gcc and clang contain runtime checker for easily detectable undefined behaviours like singed overflow you have mentioned. You can enable it with -fsanitize=undefined.
It might be true but barely matters when we have tools like KCC. It's built on an executable semantics of C that runs in a framework on top of Maude rewrite engine.
http://www.kframework.org/index.php/Main_Page
https://github.com/kframework/c-semantics
http://fsl.cs.illinois.edu/FSL/papers/2015/hathhorn-ellison-...
http://fsl.cs.illinois.edu/index.php/Defining_the_Undefinedn...
Since it's K, they were able to turn it into a GCC-like compiler for you verifying things about your application. If it even compiles, you have no undefined behavior.
https://github.com/kframework/c-semantics
On concurrency side, it's built on top of Maude tool that an inexperienced student was able to use to find errors in Eiffel's SCOOP model for concurrency. So, it can probably handle that aspect as well.
A good example of such a thing would be something like https://github.com/kframework/c-semantics
[0] http://robbertkrebbers.nl/thesis.html [1] https://github.com/kframework/c-semantics [2] http://www.kframework.org/index.php/Projects