Main Page

From K Framework

$\mathbb{K}$ is a rewrite-based executable semantic framework in which programming languages, type systems and formal analysis tools can be defined using configurations, computations and rules. Configurations organize the state in units called cells, which are labeled and can be nested. Computations carry computational meaning as special nested list structures sequentializing computational tasks, such as fragments of program. Computations extend the original language abstract syntax. K (rewrite) rules make it explicit which parts of the term they read-only, write-only, read-write, or do not care about. This makes K suitable for defining truly concurrent languages even in the presence of sharing. Computations are like any other terms in a rewriting environment: they can be matched, moved from one place to another, modified, or deleted. This makes K suitable for defining control-intensive features such as abrupt termination, exceptions or call/cc.

Quick Overview

HERE Wolfram Schulte interviews Grigore Rosu about rewrite-based semantics (at ICSE'11).
HERE is a 5 minute video demo of the K Tool (download the tool below).
PPTX PDF : a presentation on K (and on matching logic).
The documented K semantics of the IMP and IMP++ languages (generated by the K Tool).

Download and Online Interface

Download the K Tool from its Googlecode project page.
Experimental (!): You may try the Online Interface to the K tool, but be aware that it has limitations and has not been throughly tested.