Autowrite: A tool for checking properties of term rewriting systems

被引：0

作者：

Durand, I ^{[1
]}

机构：

[1] Univ Bordeaux 1, LaBRI, F-33405 Talence, France

来源：

REWRITING TECHNIQUES AND APPLICATIONS | 2002年 / 2378卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：371 / 375

页数：5

共 50 条

[1] Autowrite: A Tool for Term Rewrite Systems and Tree Automata
Durand, Irene
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 124 (02) : 29 - 49
[2] Model checking statecharts based on conditional term rewriting systems
Kwon, G
IC-AI'2000: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 1-III, 2000, : 1179 - 1185
[3] Modular Properties of Composable Term Rewriting Systems
J Symb Comput, 1 (01):
[4] Modular properties of composable term rewriting systems
Ohlebusch, E
JOURNAL OF SYMBOLIC COMPUTATION, 1995, 20 (01) : 1 - 41
[5] Multi-Completion Procedures for Term Rewriting Systems with Modern Termination Checking
Sato, Haruhiko
Kurihara, Masahito
IMETI 2008: INTERNATIONAL MULTI-CONFERENCE ON ENGINEERING AND TECHNOLOGICAL INNOVATION, VOL II, PROCEEDINGS, 2008, : 192 - 197
[6] Constrained Term Rewriting tooL
Kop, Cynthia
Nishida, Naoki
LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, (LPAR-20 2015), 2015, 9450 : 549 - 557
[7] MODULAR PROPERTIES OF CONDITIONAL TERM REWRITING-SYSTEMS
MIDDELDORP, A
INFORMATION AND COMPUTATION, 1993, 104 (01) : 110 - 158
[8] Natural rewriting for general term rewriting systems
Escobar, S
Meseguer, J
Thati, P
LOGIC BASED PROGRAM SYNTHESIS AND TRANSFORMATION, 2005, 3573 : 101 - 116
[9] INFINITARY TERM REWRITING FOR WEAKLY ORTHOGONAL SYSTEMS PROPERTIES AND COUNTEREXAMPLES
Endrullis, Joerg
Grabmayer, Clemens
Hendriks, Dimitri
Klop, Jan Willem
van Oostrom, Vincent
LOGICAL METHODS IN COMPUTER SCIENCE, 2014, 10 (02)
[10] CONFLUENT REDUCTIONS - ABSTRACT PROPERTIES AND APPLICATIONS TO TERM REWRITING SYSTEMS
HUET, G
JOURNAL OF THE ACM, 1980, 27 (04) : 797 - 821

← 1 2 3 4 5 →