4911 search results - page 118 / 983 » Tree dependence analysis |
115
Voted
FSTTCS
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a ...
157
Voted
LPAR
2004
Springer
15 years 6 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
92
Voted
DOCENG
2005
ACM
15 years 2 months ago
2005
ACM
In the domain of XML authoring, there have been many tools to help users to edit XML documents. These tools make it easier to produce complex documents by using such technologies ...
116
click to vote
DSD
2009
IEEE
15 years 7 months ago
2009
IEEE
—As CMOS process technology advances towards 32nm, SoC complexity continuously grows but its dependability significantly decreases. In this paper, a beamforming chip 1 is designe...
110
Voted
AAECC
2005
Springer
15 years 21 days ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...