From Hybrid Modal Logic to Matching Logic and Back

Ioana Leuştean
(University of Bucharest)
Natalia Moangă
(University of Bucharest)
Traian Florin Şerbănuţă
(University of Bucharest)

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.

In Mircea Marin and Adrian Crăciun: Proceedings Third Symposium on Working Formal Methods (FROM 2019), Timişoara, Romania, 3-5 September 2019, Electronic Proceedings in Theoretical Computer Science 303, pp. 16–31.
Published: 2nd September 2019.

ArXived at: http://dx.doi.org/10.4204/EPTCS.303.2 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org