Sciweavers

415 search results - page 67 / 83
» Tree Unification Grammar
Sort
View
ICSE
2007
IEEE-ACM
14 years 8 months ago
DECKARD: Scalable and Accurate Tree-Based Detection of Code Clones
Detecting code clones has many software engineering applications. Existing approaches either do not scale to large code bases or are not robust against minor code modifications. I...
Ghassan Misherghi, Lingxiao Jiang, Stéphane...
DLT
2008
13 years 10 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
ESOP
2009
Springer
14 years 14 days ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
ACL
2006
13 years 10 months ago
Trimming CFG Parse Trees for Sentence Compression Using Machine Learning Approaches
Sentence compression is a task of creating a short grammatical sentence by removing extraneous words or phrases from an original sentence while preserving its meaning. Existing me...
Yuya Unno, Takashi Ninomiya, Yusuke Miyao, Jun-ich...
HASKELL
2009
ACM
14 years 3 months ago
The architecture of the Utrecht Haskell compiler
In this paper we describe the architecture of the Utrecht Haskell Compiler (UHC). UHC is a new Haskell compiler, that supports most (but not all) Haskell 98 features, plus some ex...
Atze Dijkstra, Jeroen Fokker, S. Doaitse Swierstra