Regular tree languages as an abstract domain in program specialisation

Higher-Order and Symbolic Computation

Volumn 14, Issue 2-3, 2001, Pages 143-172

  Gallagher, John P ^a   Peralta, Julio C ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Partial evaluation; Program specialisation; Regular tree languages

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL GRAMMARS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; FUNCTIONS; LOGIC PROGRAMMING; PROGRAM INTERPRETERS; SEMANTICS;

MOST SPECIFIC GENERALISATION; PARTIAL EVALUATION; PROGRAM SPECIALISATION; REGULAR TREE LANGUAGES;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 0035466110     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1012936614361     Document Type: Article

References (48)

1. A practical framework for abstract interpretation of logic programs
2. Improving program analyses by structure untupling
3. Comparing the Galois connection and widening/narrowing approaches to abstract interpretation
4. Formal language, grammar and set-constraint-based program analysis by abstract interpretation
5. Conjunctive partial deduction: Foundations, control, algorithms, and experiments
6. Specialisation of a unification algorithm
7. Logic programs as types for logic programs
8. A system for specialising logic programs
9. Specialisation of logic programs: A tutorial
10. Specialisation of prolog and FCP programs using abstract interpretation
11. Fast and precise regular approximation of logic programs
12. Regular approximation of computation paths in logic and functional languages
13. Specialising the ground representation in the logic programming language gödel
14. A finite presentation theorem for approximating logic programs
15. Meta-programming in logic programming
16. Deriving descriptions of possible values of program variables by means of abstract interpretation
17. Combining abstract interpretation and partial evaluation
18. A flexible approach to interprocedural data flow analysis and programs with recursive data structures
19. How to invent a prolog machine
20. A constraint-based partial evaluator for functional logic programs and its application
21. Program specialisation and abstract interpretation reconciled
22. On the power of homeomorphic embedding for online termination
23. Program specialisation and abstract interpretation reconciled
24. Logic program specialisation: How to be more specific
25. Global control for partial deduction through characteristic atoms and global trees
26. Type domains for abstract interpretation: A critical study
27. Towards a theory of types in prolog
28. Partially static structures in a self-applicable partial evaluator
29. Compile-time derivation of variable dependency using abstract interpretation
30. Analysis and specialisation of imperative programs: An approach using CLP
31. Imperative program specialisation: An approach using CLP
32. Analysis of imperative programs through analysis of constraint logic programs
33. An integration of partial evaluation in a generic abstract interpretation framework
34. Automatic construction of data set definitions
35. Transformational systems and the algebraic structure of atomic formulas
36. Constrained regular approximation of logic programs
37. An automatic partial evaluator for full prolog
38. An algorithm of generalisation in positive supercompilation
39. Enumeration of success-patterns in logic programs
40. Unfold/fold transformation of logic programs
41. OLDT resolution with tabulation
42. The algorithm of generalization in the supercompiler
43. Type analysis of prolog using type graphs
44. Specialising the other way around
45. A type system for logic programs