MVA
2007
13 years 4 months ago
2007
The application of a technique for labelling connected components based on the classical recursive technique is studied. The recursive approach permits labelling, counting, and cha...
CSL
2008
Springer
13 years 6 months ago
2008
Springer
Type-based termination is a semantically intuitive method that ensures termination of recursive definitions by tracking the size of datatype elements, and by checking that recursiv...
FPL
2005
Springer
13 years 10 months ago
2005
Springer
The paper analyses and compares alternative iterative and recursive implementations of FPGA circuits for various problems. Two types of recursive calls have been examined, namely ...
CADE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...
CC
2009
Springer
14 years 5 months ago
2009
Springer
Speculative parallelisation represents a promising solution to speed up sequential programs that are hard to parallelise otherwise. Prior research has focused mainly on parallelisi...