论文信息 - Testing Completeness of Code Selector Specifications

Testing Completeness of Code Selector Specifications

The tree pattern matching approach for code selection has proven very successful. This paper presents an algorithm to test the completeness of a code selector specification. A specification is said to be complete, if it can produce code for every possible intermediate code tree produced by the front end.

Helmut Emmelmann

[1] Christoph M. Hoffmann,et al. Pattern Matching in Trees , 1982, JACM.

[2] Helmut Emmelmann,et al. BEG: a generator for efficient back ends , 1989, PLDI '89.

[3] David R. Chase,et al. An improvement to bottom-up tree pattern matching , 1987, POPL '87.

[4] Robert Giegerich,et al. Code Selection Techniques: Pattern Matching, Tree Parsing, and Inversion of Derivors , 1988, ESOP.

[5] Robert Giegerich. Code Selection by Inversion of Order-Sorted Derivors , 1990, Theor. Comput. Sci..

[6] Thomas W. Christopher,et al. High-quality code generation via bottom-up tree pattern matching , 1986, POPL '86.