A Truly Concurrent Semantics for the $\mathbb{K}$ Framework Based on Graph Transformations

DOI10.1007/978-3-642-33654-6_20zbMath1367.68179OpenAlexW1950130824MaRDI QIDQ2918990

Traian-Florin Şerbănuţă, Grigore Roşu

Publication date: 2 October 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33654-6_20

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

The rewriting logic semantics project: a progress report

Uses Software

• K Prover

This page was built for publication: A Truly Concurrent Semantics for the $\mathbb{K}$ Framework Based on Graph Transformations