Difference between revisions of "Matching mu-Logic: Foundation of K Framework"

From FSL
Jump to: navigation, search
(Created page with "<private> == CALCO 2019 Submission == <pubbib id='chen-rosu-2019-calco-submission' template='PubDefaultWithAbstractAndTitle'/> </private>")
 
Line 1: Line 1:
<private>
+
== CALCO 2019 ==
== CALCO 2019 Submission ==
+
<pubbib id='chen-rosu-2019-calco' template='PubDefaultWithAbstractAndTitle'/>
<pubbib id='chen-rosu-2019-calco-submission' template='PubDefaultWithAbstractAndTitle'/>
+
</private>
+

Revision as of 01:18, 26 November 2019

CALCO 2019

Matching mu-Logic: Foundation of K Framework
Xiaohong Chen and Grigore Rosu
CALCO'19, Leibniz International Proceedings in Informatics (LIPIcs) 139, pp 1-4. 2019
Abstract. K framework is an effort in realizing the ideal language framework where programming languages must have formal semantics and all languages tools are automatically generated from the formal semantics in a correct-by-construction manner at no additional costs. In this extended abstract, we present matching mu-logic as the foundation of K and discuss some of its applications in defining constructors, transition systems, modal mu-logic and temporal logic variants, and reachability logic.
PDF, Slides(PPTX), Matching Logic, DOI, CALCO'19, BIB

Personal tools
Namespaces

Variants
Actions
Navigation