Abstract Syntax Tree Pattern Matching is a formal method for identifying and extracting structural patterns within abstract syntax trees by specifying template-based queries that match node configurations according to syntactic and semantic constraints.
15
Publications
960
Citations
27
Authors
17
Institutions
Publications per year
2017–2026
0
Parents
Publications
15
1–5 of 15
Authors
27
- IN
2
h-index
- MH
2
h-index
- DC
2
h-index
- JS
2
h-index
- WG
2
h-index
1–5 of 27
Institutions
17
University of Maryland, College Park
College Park, United States
2 h-index
6 publications
984 citations
University of California San Diego
San Diego, United States
2 h-index
3 publications
110 citations
AT&T (United States)
Bedminster, United States
2 h-index
2 publications
251 citations
University of Arizona
Tucson, United States
1 h-index
1 publications
211 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
1 h-index
3 publications
33 citations
Microsoft (United States)
Redmond, United States
1 h-index
1 publications
121 citations
Nokia (United States)
Coppell, United States
1 h-index
1 publications
40 citations
Rice University
Houston, United States
1 h-index
1 publications
50 citations
1–8 of 17
Venues
- Document Server@UHasselt (UHasselt)
Repository · 1 publications · 63 citations
1
h-index
- The Journal of Object Technology
JOT · 1 publications · 13 citations
1
h-index
- ACM Letters on Programming Languages and Systems
LOPLAS · 1 publications · 211 citations
1
h-index
- ACM SIGSOFT Software Engineering Notes
SEN · 1 publications · 198 citations
1
h-index
- Software Practice and Experience
1 publications · 10 citations
1
h-index
1–5