Decision method of reachability based on rewrite rule overlapping

被引：0
|
作者：
机构：
[1] [1,Shimanuki, Kentaro
[2] Aoto, Takahito
[3] Toyama, Yoshihito
来源：
| 1600年 / Japan Society for Software Science and Technology卷 / 33期
关键词：
721.1 Computer Theory; Includes Formal Logic; Automata Theory; Switching Theory; Programming Theory - 821 Agricultural Equipment and Methods; Vegetation and Pest Control - 921 Mathematics - 931.1 Mechanics;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
9
引用
收藏
相关论文
共 50 条
  • [1] A Completion Method to Decide Reachability in Rewrite Systems
    Burel, Guillaume
    Dowek, Gilles
    Jiang, Ying
    FRONTIERS OF COMBINING SYSTEMS, FROCOS 2015, 2015, 9322 : 205 - 219
  • [2] A rewrite rule based pramework for combining decision procedures - Preliminary draft
    Kapur, D
    FRONTIERS OF COMBINING SYSTEMS, 2002, 2309 : 87 - 102
  • [3] A Constructor-Based Reachability Logic for Rewrite Theories
    Skeirik, Stephen
    Stefanescu, Andrei
    Meseguer, Jose
    LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION (LOPSTR 2017), 2018, 10855 : 201 - 217
  • [4] A Constructor-Based Reachability Logic for Rewrite Theories
    Skeirik, Stephen
    Stefanescu, Andrei
    Meseguer, Jose
    FUNDAMENTA INFORMATICAE, 2020, 173 (04) : 315 - 382
  • [5] Reachability analysis of process rewrite systems
    Bouajjani, A
    Touili, T
    FST TCS 2003: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 2003, 2914 : 74 - 87
  • [6] Constrained Reachability of Process Rewrite Systems
    Touili, Tayssir
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2009, 2009, 5684 : 307 - 321
  • [7] Rewrite-Based Decision Procedures
    Bonacina, Maria Paola
    Echenim, Mnacho
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2007, 174 (11) : 27 - 45
  • [8] On computing reachability sets of process rewrite systems
    Bouajjani, A
    Touili, T
    TERM REWRITING AND APPLICATIONS, PROCEEDINGS, 2005, 3467 : 484 - 499
  • [9] PROOFS AND REACHABILITY PROBLEM FOR GROUND REWRITE SYSTEMS
    COQUIDE, JL
    GILLERON, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 464 : 120 - 129
  • [10] Extended process rewrite systems:: Expressiveness and reachability
    Kretínsky, M
    Rehák, V
    Strejcek, J
    CONCUR 2004 - CONCURRENCY THEORY, PROCEEDINGS, 2004, 3170 : 355 - 370
12345