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 条
  • [41] Type specialisation for imperative languages
    Dussart, D
    Hughes, J
    Thiemann, P
    ACM SIGPLAN NOTICES, 1997, 32 (08) : 204 - 216
  • [42] Deciding Top-Down Determinism of Regular Tree Languages
    Leupold, Peter
    Maneth, Sebastian
    FUNDAMENTALS OF COMPUTATION THEORY, FCT 2021, 2021, 12867 : 341 - 353
  • [43] On the Complexity of Intersecting Regular, Context-Free, and Tree Languages
    Swernofsky, Joseph
    Wehar, Michael
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 2015, 9135 : 414 - 426
  • [44] Test sets for the universal and existential closure of regular tree languages
    Hofbauer, D
    Huber, M
    INFORMATION AND COMPUTATION, 2002, 178 (02) : 465 - 498
  • [45] Path languages of random permitting context tree grammars are regular
    Drewes, Frank
    van der Merwe, Brink
    FUNDAMENTA INFORMATICAE, 2008, 82 (1-2) : 47 - 60
  • [46] Problems in understanding abstract concepts related to regular and context-free languages
    Rana, Zeeshan Ali
    Iqbal, Muhammad Ashraf
    Hashmi, Yasser
    PROCEEDINGS OF THE 6TH WSEAS INTERNATIONAL CONFERENCE ON EDUCATION AND EDUCATIONAL TECHNOLOGY (EDU'07): NEW HORIZONS IN EDUCATION AND EDUCATIONAL TECHNOLOGY, 2007, : 115 - +
  • [47] A Parametric Abstract Domain for Lattice-Valued Regular Expressions
    Midtgaard, Jan
    Nielson, Flemming
    Nielson, Hanne Riis
    STATIC ANALYSIS, (SAS 2016), 2016, 9837 : 338 - 360
  • [48] A decision tree abstract domain for proving conditional termination
    Urban, Caterina
    Miné, Antoine
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8723 : 302 - 318
  • [49] A Decision Tree Abstract Domain for Proving Conditional Termination
    Urban, Caterina
    Mine, Antoine
    STATIC ANALYSIS (SAS 2014), 2014, 8723 : 302 - 318
  • [50] Program Comprehension for Domain-Specific Languages
    Varanda Pereira, Maria Joao
    Mernik, Marjan
    da Cruz, Daniela
    Henriques, Pedro Rangel
    COMPUTER SCIENCE AND INFORMATION SYSTEMS, 2008, 5 (02) : 1 - 17
12345