From Hybrid Modal Logic to Matching Logic and Back
Logic in Computer Science
2019-09-05 v2
Abstract
Building on our previous work on hybrid polyadic modal logic we identify modal logic equivalents for Matching Logic, a logic for program specification and verification. This provides a rigorous way to transfer results between the two approaches, which should benefit both systems.
Cite
@article{arxiv.1907.05029,
title = {From Hybrid Modal Logic to Matching Logic and Back},
author = {Ioana Leuştean and Natalia Moangă and Traian Florin Şerbănuţă},
journal= {arXiv preprint arXiv:1907.05029},
year = {2019}
}
Comments
In Proceedings FROM 2019, arXiv:1909.00584