688 search results - page 41 / 138 » Types for trees |
103
Voted
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
99
Voted
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
Recognizing and analyzing change is an important human virtue because it enables us to anticipate future scenarios and thus allows us to act pro-actively. One approach to understa...
102
Voted
IWSEC
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Attack tree analysis is used to estimate different parameters of general security threats based on information available for atomic subthreats. We focus on estimating the...
115
click to vote
LICS
2010
IEEE
14 years 11 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
133
Voted
IWPSE
2007
IEEE
15 years 7 months ago
2007
IEEE
We present a method to detect and visualize evolution patterns in C++ source code. Our method consists of three steps. First, we extract an annotated syntax tree (AST) from each v...