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
关键词
Most specific generalisation - Partial evaluation - Program specialisation - Regular tree languages;
D O I
10.1023/A:1012936614361
中图分类号
学科分类号
摘要
引用
收藏
页码:143 / 172
相关论文
共 50 条
  • [11] Regular tree languages and rewrite systems
    Fundam Inf, 1-2 (157):
  • [12] Alignment distance of regular tree languages
    Han, Yo-Sub
    Ko, Sang-Ki
    THEORETICAL COMPUTER SCIENCE, 2019, 787 : 127 - 137
  • [13] Property testing of regular tree languages
    Magniez, F
    de Rougemont, M
    AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 932 - 944
  • [14] Algebraic recognizability of regular tree languages
    Ésik, Z
    Weil, P
    THEORETICAL COMPUTER SCIENCE, 2005, 340 (02) : 291 - 321
  • [15] Property testing of regular tree languages
    Magniez, Frederic
    de Rougemont, Michel
    ALGORITHMICA, 2007, 49 (02) : 127 - 146
  • [16] Property Testing of Regular Tree Languages
    Frédéric Magniez
    Michel de Rougemont
    Algorithmica, 2007, 49 : 127 - 146
  • [17] Stochastic inference of regular tree languages
    Carrasco, RC
    Oncina, J
    Calera-Rubio, J
    MACHINE LEARNING, 2001, 44 (1-2) : 185 - 197
  • [18] Bounded Repairability for Regular Tree Languages
    Bourhis, Pierre
    Puppis, Gabriele
    Riveros, Cristian
    Staworko, Slawek
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2016, 41 (03):
  • [19] State Complexity of Regular Tree Languages for Tree Matching
    Ko, Sang-Ki
    Lee, Ha-Rim
    Han, Yo-Sub
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2016, 27 (08) : 965 - 979
  • [20] Infinite state model checking by abstract interpretation and program specialisation
    Leuschel, M
    Massart, T
    LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION, PROCEEDINGS, 2000, 1817 : 62 - 81