From Hybrid Modal Logic to Matching Logic and back

07/11/2019

∙

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.

READ FULL TEXT

From Hybrid Modal Logic to Matching Logic and back

A many-sorted polyadic modal logic

Many-Sorted Hybrid Modal Languages

Graded modal logic and counting bisimulation

Strengthening Consistency Results in Modal Logic

Some notes on the superintuitionistic logic of chequered subsets of R^∞

Demonstrating (Hybrid) Active Logic Documents and the Ciao Prolog Playground, and an Application to Verification Tutorials

Behavioral Mereology: A Modal Logic for Passing Constraints

From Hybrid Modal Logic to Matching Logic and back

Related Research

A many-sorted polyadic modal logic

Many-Sorted Hybrid Modal Languages

Graded modal logic and counting bisimulation

Strengthening Consistency Results in Modal Logic

Some notes on the superintuitionistic logic of chequered subsets of R^∞

Demonstrating (Hybrid) Active Logic Documents and the Ciao Prolog Playground, and an Application to Verification Tutorials

Behavioral Mereology: A Modal Logic for Passing Constraints