Approximating Dependency Graphs Using Tree Automata Techniques-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Approximating Dependency Graphs Using Tree Automata Techniques

Published:2001 Issue: Volume: Page:593-610
ISSN:0302-9743
Container-title:Automated Reasoning
language:
Short-container-title:

Author:

Middeldorp Aart

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45744-5_49

Reference28 articles.

1. Lect Notes Comput Sci;T. Arts,2000

2. Lect Notes Comput Sci;T. Arts,1998

3. Lect Notes Comput Sci;T. Arts,2000

4. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. The-oretical Computer Science, 236:133–178, 2000.

5. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. First-Order Theory of Rewriting for Linear Variable-Separated Rewrite Systems: Automation, Formalization, Certification;Journal of Automated Reasoning;2023-04-06

2. Term Orderings for Non-reachability of (Conditional) Rewriting;Automated Reasoning;2022

3. CoCo 2019: report on the eighth confluence competition;International Journal on Software Tools for Technology Transfer;2021-05-28

4. Confluence Competition 2019;Tools and Algorithms for the Construction and Analysis of Systems;2019

5. Reachability Analysis for Termination and Confluence of Rewriting;Tools and Algorithms for the Construction and Analysis of Systems;2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP