I. Leustean, Natalia Moanga, Traian-Florin Serbanuta
{"title":"从混合模态逻辑到匹配逻辑再回来","authors":"I. Leustean, Natalia Moanga, Traian-Florin Serbanuta","doi":"10.4204/EPTCS.303.2","DOIUrl":null,"url":null,"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.","PeriodicalId":9644,"journal":{"name":"Catalysis Surveys from Japan","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"From Hybrid Modal Logic to Matching Logic and back\",\"authors\":\"I. Leustean, Natalia Moanga, Traian-Florin Serbanuta\",\"doi\":\"10.4204/EPTCS.303.2\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":9644,\"journal\":{\"name\":\"Catalysis Surveys from Japan\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Catalysis Surveys from Japan\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.303.2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Catalysis Surveys from Japan","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.303.2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
From Hybrid Modal Logic to Matching Logic and back
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
