![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Bruce Collie, Runtime Verification
Friday 07 October 2022, 14:00-15:00
Verification for free: using K to build a theorem prover for any language
- đ¤ Speaker: Bruce Collie, Runtime Verification
- đ Date & Time: Friday 07 October 2022, 14:00 - 15:00
- đ Venue: SS03
Abstract
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.
Series This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computing and Mathematics
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Logic and Semantics Seminar (Computer Laboratory)
- Martin's interesting talks
- School of Technology
- SS03
- tcw57âs list
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.