Autowrite: A tool for checking properties of term rewriting systems

被引:0
|
作者
Durand, I [1 ]
机构
[1] Univ Bordeaux 1, LaBRI, F-33405 Talence, France
来源
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:371 / 375
页数:5
相关论文
共 50 条
  • [31] A compiler for nondeterministic term rewriting systems
    Vittek, M
    REWRITING TECHNIQUES AND APPLICATIONS, 1996, 1103 : 154 - 168
  • [32] Model-checking infinite systems generated by ground tree rewriting
    Löding, C
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2002, 2303 : 280 - 294
  • [33] A Coinductive Approach to Proving Reachability Properties in Logically Constrained Term Rewriting Systems
    Ciobaca, Stefan
    Lucanu, Dorel
    AUTOMATED REASONING, IJCAR 2018, 2018, 10900 : 295 - 311
  • [35] Type Checking with Rewriting Rules
    Racordon, Dimi
    PROCEEDINGS OF THE 17TH ACM SIGPLAN INTERNATIONAL CONFERENCE ON SOFTWARE LANGUAGE ENGINEERING, SLE 2024, 2024, : 171 - 183
  • [36] Model Checking of Real-Time Systems Using Rewriting Logic
    Bendiaf, Messaoud
    Bourahla, Mustapha
    Boudia, Malika
    Rehab, Seidali
    PROCEEDINGS OF 2017 INTERNATIONAL CONFERENCE ON ELECTRICAL AND INFORMATION TECHNOLOGIES (ICEIT 2017), 2017,
  • [37] Rewriting Induction for Higher-Order Constrained Term Rewriting Systems
    Hagens, Kasper
    Kop, Cynthia
    LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION, LOPSTR 2024, 2024, 14919 : 202 - 219
  • [38] On some slowly terminating term rewriting systems
    Beklemishev, L. D.
    Onoprienko, A. A.
    SBORNIK MATHEMATICS, 2015, 206 (09) : 1173 - 1190
  • [39] Well limit behaviors of term rewriting systems
    Ma S.
    Sui Y.
    Xu K.
    Frontiers of Computer Science in China, 2007, 1 (03): : 283 - 296
  • [40] On term rewriting systems having a rational derivation
    Meyer, A
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2004, 2987 : 378 - 392