Re: matching ASTs

"Ira D. Baxter" <idbaxter@semdesigns.com>
19 Oct 2000 14:26:16 -0400

          From comp.compilers

Related articles
matching ASTs compilers@al-got-rhythm.net (J Alan Brogan) (2000-10-12)
Re: matching ASTs cfc@world.std.com (Chris F Clark) (2000-10-15)
Re: matching ASTs plakal@cs.wisc.edu (2000-10-15)
Re: matching ASTs eballen1@uswest.net (Bruce Ediger) (2000-10-15)
Re: matching ASTs lindig@eecs.harvard.edu (Christian Lindig) (2000-10-18)
Re: matching ASTs idbaxter@semdesigns.com (Ira D. Baxter) (2000-10-19)
matching ASTs metzger@rsn.hp.com (Robert Metzger) (2000-10-19)
| List of all articles for this month |

From: "Ira D. Baxter" <idbaxter@semdesigns.com>
Newsgroups: comp.compilers
Date: 19 Oct 2000 14:26:16 -0400
Organization: Posted via Supernews, http://www.supernews.com
References: 00-10-095
Keywords: analysis

We did work on finding duplicate code in software systems.
A paper on clone detection:


      Baxter, I., Yahin, A., Moura, L., Sant'Anna, M., and Bier, L. 1998.
      Clone Detection Using Abstract Syntax Trees.
      Proceedings of the International Conference on Software Maintenance '98,
1998, IEEE Press


  that defines similarity can be found at
      http://www.semdesigns.com/CompInfo/Publications/index.html#DMS




--
Ira Baxter, Ph.D., CTO idbaxter@semdesigns.com 512-250-1018x140
Semantic Designs, Inc., www.semdesigns.com FAX 512-250-1191
12636 Research Blvd #C214, Austin, Texas 78759




"J Alan Brogan" <compilers@al-got-rhythm.net> wrote in message
> Can anyone give me any help in the matching of syntax trees - how to find
> out whether two such trees are "similar", and what "similar" might mean.
>


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.