251 search results - page 2 / 51 » Automated Complexity Analysis Based on the Dependency Pair M... |
CADE
2009
Springer
14 years 5 months ago
2009
Springer
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
ICDAR
2005
IEEE
13 years 10 months ago
2005
IEEE
– This paper describes a new approach to recognize touching numeral strings. Currently most methods for numeral string recognition require segmenting the string image into separa...
KBSE
2010
IEEE
13 years 3 months ago
2010
IEEE
Named constants are used heavily in operating systems code, both as internal flags and in interactions with devices. Decision making within an operating system thus critically de...
LOPSTR
2007
Springer
13 years 11 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...