Regular tree languages as an abstract domain in program specialisation

被引：12
|
作者：
Gallagher, John P. [1 ]
Peralta, Julio C. [1 ]
机构：
[1] Department of Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol BS8 1UB, United Kingdom
来源：
Higher-Order and Symbolic Computation | 2001年 / 14卷 / 2-3期
关键词：
Most specific generalisation - Partial evaluation - Program specialisation - Regular tree languages;
D O I：
10.1023/A:1012936614361
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：143 / 172
相关论文
共 50 条
  • [31] Generating, Sampling and Counting Subclasses of Regular Tree Languages
    Timos Antonopoulos
    Floris Geerts
    Wim Martens
    Frank Neven
    Theory of Computing Systems, 2013, 52 : 542 - 585
  • [32] COMPUTING RELATIVE NORMAL FORMS IN REGULAR TREE LANGUAGES
    Koller, Alexander
    Thater, Stefan
    PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON REWRITING TECHNIQUES AND APPLICATIONS (RTA'10), 2010, 6 : 177 - 191
  • [33] COMPUTATION TREE LOGIC AND REGULAR OMEGA-LANGUAGES
    THOMAS, W
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 354 : 690 - 713
  • [34] Generating, Sampling and Counting Subclasses of Regular Tree Languages
    Antonopoulos, Timos
    Geerts, Floris
    Martens, Wim
    Neven, Frank
    THEORY OF COMPUTING SYSTEMS, 2013, 52 (03) : 542 - 585
  • [35] Computing the relative entropy between regular tree languages
    Calera-Rubio, J
    Carrasco, RC
    INFORMATION PROCESSING LETTERS, 1998, 68 (06) : 283 - 289
  • [36] A Binary Decision Tree Abstract Domain Functor
    Chen, Junjie
    Cousot, Patrick
    STATIC ANALYSIS (SAS 2015), 2015, 9291 : 36 - 53
  • [37] Top-down tree edit-distance of regular tree languages
    Ko, Sang-Ki
    Han, Yo-Sub
    Salomaa, Kai
    INTERNATIONAL JOURNAL OF ADVANCES IN ENGINEERING SCIENCES AND APPLIED MATHEMATICS, 2019, 11 (01) : 2 - 10
  • [38] Top-Down Tree Edit-Distance of Regular Tree Languages
    Ko, Sang-Ki
    Han, Yo-Sub
    Salomaa, Kai
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014), 2014, 8370 : 466 - 477
  • [39] Top-down tree edit-distance of regular tree languages
    Sang-Ki Ko
    Yo-Sub Han
    Kai Salomaa
    International Journal of Advances in Engineering Sciences and Applied Mathematics, 2019, 11 : 2 - 10
  • [40] Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
    Diekert, Volker
    Kopecki, Steffen
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2011, 6482 : 105 - 114
12345