Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Natalia Moanga"'
Publikováno v:
Fundamenta Informaticae. 173:191-215
This paper presents a many-sorted polyadic modal logic that generalizes some of the existing approaches. The algebraic semantics has led us to a many-sorted generalization of boolean algebras with operators, for which we prove the analogue of the J\'
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::777a5e0e5dee3e6b5e44d82aee0fae73
https://doi.org/10.3233/fi-2020-1921
https://doi.org/10.3233/fi-2020-1921
Publikováno v:
FROM
Electronic Proceedings in Theoretical Computer Science, Vol 303, Iss Proc. FROM 2019, Pp 16-31 (2019)
Electronic Proceedings in Theoretical Computer Science, Vol 303, Iss Proc. FROM 2019, Pp 16-31 (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, whic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4341ef820afb2538054472748fff472f
https://doi.org/10.4204/eptcs.303.2
https://doi.org/10.4204/eptcs.303.2
Autor:
Natalia Moanga
Publikováno v:
SYNASC
In prior work we have developed a many-sorted polyadic modal logic. Progressively adding different operations and binders, we expressed operational semantics, thus enabling us to certify execution. In this paper we prove standard completeness for a m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b07a59444827f50df15bf835e72265f0
https://doi.org/10.1109/synasc51798.2020.00022
https://doi.org/10.1109/synasc51798.2020.00022
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030290252
TABLEAUX
TABLEAUX
We propose a general framework to allow: (a) specifying the operational semantics of a programming language; and (b) stating and proving properties about program correctness. Our framework is based on a many-sorted system of hybrid modal logic, for w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eed33e3000ebbc7ffefe9e1bcec3e910
https://doi.org/10.1007/978-3-030-29026-9_25
https://doi.org/10.1007/978-3-030-29026-9_25
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 120:100644
We continue our investigation into hybrid polyadic multi-sorted logic with a focus on expresivity related to the operational and axiomatic semantics of rogramming languages, and relations with first-order logic. We identify a fragment of the full log
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a5805adbdae239581e1cc62bee70b7c8
https://doi.org/10.1016/j.jlamp.2021.100644
https://doi.org/10.1016/j.jlamp.2021.100644
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 303, Iss Proc. FROM 2019, Pp 16-31 (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, whic
Externí odkaz:
https://doaj.org/article/43173f457a144c60acc14bb2964720f6