4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Selected papers of the Second Workshop on Concurrency and compositionality
A syntactic approach to type soundness
Information and Computation
Essentials of programming languages (2nd ed.)
Essentials of programming languages (2nd ed.)
Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
The rewriting logic semantics project
Theoretical Computer Science
Theoretical Computer Science
A rewriting logic approach to operational semantics
Information and Computation
A Rewriting Logic Approach to Type Inference
Recent Trends in Algebraic Development Techniques
Runtime Verification of C Memory Safety
Runtime Verification
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Collecting semantics under predicate abstraction in the K framework
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Matching logic: an alternative to hoare/floyd logic
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Path Directed Symbolic Execution in the K Framework
SYNASC '10 Proceedings of the 2010 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Matching logic: a new program verification approach (NIER track)
Proceedings of the 33rd International Conference on Software Engineering
The rewriting logic semantics project: a progress report
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
An executable formal semantics of C with applications
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Test-case reduction for C compiler bugs
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
A K-based formal framework for domain-specific modelling languages
FoVeOOS'11 Proceedings of the 2011 international conference on Formal Verification of Object-Oriented Software
Making maude definitions more interactive
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
Hi-index | 0.00 |
$\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 are special nested list structures sequentializing computational tasks, such as fragments of program. $\mathbb{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 $\mathbb{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 $\mathbb{K}$ suitable for defining control-intensive features such as abrupt termination, exceptions or call/cc. This paper presents an overview of $\mathbb{K}$ Framework and the $\mathbb{K}$ Tool, focusing on the interaction between the $\mathbb{K}$ Tool and Maude.