Operational Semantics and Program Verification Using Many-Sorted Hybrid Modal Logic

Leustean, Ioana; Moanga, Natalia; Şerbănuţă, Traian Florin

doi:10.1007/978-3-030-29026-9_25

Cited by 3 publications

(7 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this paper, we continue our work from [9,10], where we defined a (hybrid) many-sorted polyadic modal logic, for which we proved soundness and completeness, generalizing well-known results from the mono-sorted setting [5].…”

Section: Introductionmentioning

confidence: 78%

“…Our research was inspired by Matching logic [12] which made some connections with modal logic 1 . Nevertheless, while the system we proposed in [10] was strong enough for performing specification and formal verification, its connection with Matching logic, its original motivation, was still to be established.…”

Section: Introductionmentioning

confidence: 99%

“…(1) We isolate H Σ (∀), a fragment of the system presented in [10], and we show that, when restricted to global deduction, it is equivalent with Matching Logic without definedness.…”

Section: Introductionmentioning

confidence: 99%

“…(2) We introduce H Σ (@ z , ∀), a strengthening of the system from [10] which allows the satisfaction operators @ s z to also range over state variables, and we show that, when restricted to global deduction, it is equivalent to Matching Logic with the definedness operator.…”

Section: Introductionmentioning

confidence: 99%

“…For (S, Σ) a many-sorted signature, the many-sorted polyadic modal logic H Σ defined in [9] is recalled in Figure 1. The system H Σ (∀), defined in Section 2, is a fragment of the system introduced by [10] which enriches H Σ with nominals, state variables and the forall binder. This system is a manysorted generalization of a hybrid modal logic defined in [3].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

From Hybrid Modal Logic to Matching Logic and Back

Leustean

Moanga

Şerbănuţă

2019

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

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. * All authors contributed equally to this work. 1 Note that Matching logic was further developed in [6], where techniques from modal logic are employed for the theoretical development. s = φ for any w ∈ W s ; in this case we write M | s = φ . The deductive system of H Σ is recalled in 1 and the completeness theorem is proved in [9]. The hybridization of our many-sorted modal logic is developed using a combination of ideas and techniques from [1,2,3,5,7,8], but for this section we drew our inspiration mainly form [3]. We refer to [10] for some similar proofs of the results presented in this section.Hybrid logic is defined on top of modal logic by adding nominals, states variables and specific operators and binders. Nominals allow us to directly refer the worlds (states) of a model, since they are evaluated in singletons in any model. However, a nominal may refer different worlds in different models. The sorts will be denoted by s, t, . . . and by PROP = {PROP s } s∈S , NOM = {NOM s } s∈S and SVAR = {SVAR s } s∈S we will denote some countable S-sorted sets. The elements of PROP are ordinary propositional variables and they will be denoted p, q,. . .; the elements of NOM are called nominals and they will be denoted by j, k, . . .; the elements of SVAR are called state variables and they are denoted x, y, . . .. We shall assume that for any distinct sorts s = t ∈ S, the corresponding sets of propositional variables, nominals and state variables are distinct. A state symbol is a nominal or a state variable.Definition 1 (H Σ (∀) formulas). For any s ∈ S we define the formulas of sort s: φ s := p | j | y s | ¬φ s | φ s ∨ φ s | σ (φ s 1 , . . . , φ s n ) s | ∀x t φ s

show abstract

Section: Introductionmentioning

confidence: 78%

Section: Introductionmentioning

confidence: 99%

“…(1) We isolate H Σ (∀), a fragment of the system presented in [10], and we show that, when restricted to global deduction, it is equivalent with Matching Logic without definedness.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations