Completeness and incompleteness in nominal Kleene algebra

被引:2
|
作者
Kozen, Dexter [1 ]
Mamouras, Konstantinos [2 ]
Silva, Alexandra [3 ]
机构
[1] Cornell Univ, Dept Comp Sci, Ithaca, NY 14853 USA
[2] Univ Penn, CIS Dept, Philadelphia, PA 19104 USA
[3] UCL, Dept Comp Sci, London WC1E 6BT, England
基金
美国国家科学基金会;
关键词
Kleene algebra; Nominal sets; Programming logic;
D O I
10.1016/j.jlamp.2017.06.002
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Gabbay and Ciancia (2011) presented a nominal extension of Kleene algebra as a framework for trace semantics with statically scoped allocation of resources, along with a semantics consisting of nominal languages. They also provided an axiomatization that captures the behavior of the scoping operator and its interaction with the Kleene algebra operators and proved soundness over nominal languages. In this paper, we show that the axioms proposed by Gabbay and Ciancia are not complete over the semantic interpretation they propose. We then identify a slightly wider class of language models over which they are sound and complete. (C) 2017 Elsevier Inc. All rights reserved.
引用
收藏
页码:17 / 32
页数:16
相关论文
共 50 条
  • [1] Completeness and Incompleteness in Nominal Kleene Algebra
    Kozen, Dexter
    Mamouras, Konstantinos
    Silva, Alexandra
    RELATIONAL AND ALGEBRAIC METHODS IN COMPUTER SCIENCE (RAMICS 2015), 2015, 9348 : 51 - 66
  • [2] Completeness and Incompleteness of Synchronous Kleene Algebra
    Wagemaker, Jana
    Bonsangue, Marcello
    Kappe, Tobias
    Rot, Jurriaan
    Silva, Alexandra
    MATHEMATICS OF PROGRAM CONSTRUCTION, 2019, 11825 : 385 - 413
  • [3] Kleene algebra with tests: Completeness and decidability
    Kozen, D
    Smith, F
    COMPUTER SCIENCE LOGIC, 1997, 1258 : 244 - 259
  • [4] ON TOOLS FOR COMPLETENESS OF KLEENE ALGEBRA WITH HYPOTHESES
    Pous, Damien
    Rot, Jurriaan
    Wagemaker, Jana
    LOGICAL METHODS IN COMPUTER SCIENCE, 2024, 20 (02) : 1 - 8
  • [5] On Tools for Completeness of Kleene Algebra with Hypotheses
    Pous, Damien
    Rot, Jurriaan
    Wagemaker, Jana
    RELATIONAL AND ALGEBRAIC METHODS IN COMPUTER SCIENCE (RAMICS 2021), 2021, 13027 : 378 - 395
  • [6] Completeness of Finitely Weighted Kleene Algebra with Tests
    Sedlar, Igor
    LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION, WOLLIC 2024, 2024, 14672 : 210 - 224
  • [7] Local Completeness Logic on Kleene Algebra with Tests
    Milanese, Marco
    Ranzato, Francesco
    STATIC ANALYSIS, SAS 2022, 2022, 13790 : 350 - 371
  • [8] COMPLETENESS THEOREMS FOR KLEENE ALGEBRA WITH TESTS AND TOP
    Pous, Damien
    Wagemaker, Jana
    Logical Methods in Computer Science, 2024, 20 (03):
  • [9] Concurrent Kleene Algebra with Observations: from Hypotheses to Completeness
    Kappe, Tobias
    Brunet, Paul
    Silva, Alexandra
    Wagemaker, Jana
    Zanasi, Fabio
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2020, 2020, 12077 : 381 - 400
  • [10] Completeness and the Finite Model Property for Kleene Algebra, Reconsidered
    Kappe, Tobias
    RELATIONAL AND ALGEBRAIC METHODS IN COMPUTER SCIENCE, RAMICS 2023, 2023, 13896 : 158 - 175