University of Cambridge > > Logic and Semantics Seminar (Computer Laboratory) > Verification for free: using K to build a theorem prover for any language

Verification for free: using K to build a theorem prover for any language

Add to your list(s) Download to your calendar using vCal

  • UserBruce Collie, Runtime Verification
  • ClockFriday 07 October 2022, 14:00-15:00
  • HouseSS03.

If you have a question about this talk, please contact Jamie Vicary.

The K Framework allows you to produce all your language’s tools (parser, fast concrete interpreter, symbolic execution, ...) from a single definition of its syntax and operational semantics. To do so, we rely on a consistent internal formalism based on term rewriting. In this talk, I’ll first briefly introduce the K language and explain how we compile arbitrary language definitions down to this internal formalism.

Perhaps the most important tool that K offers is deductive verification. In the second part of my talk, I’ll give an overview of the underlying modal logic for this capability (matching-mu logic), along with the kinds of formulae we’re interested in proving in it. From here, we can join the dots back to the terms generated by the K compiler, and derive a full formal verification toolchain for any language.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity