Sciweavers

1147 search results - page 60 / 230
» Termination in language-based systems
Sort
View
LICS
2008
IEEE
14 years 3 months ago
The Ordinal Recursive Complexity of Lossy Channel Systems
We show that reachability and termination for lossy channel systems is exactly at level Fωω in the Fast-Growing Hierarchy of recursive functions, the first level that dominates...
Pierre Chambart, Ph. Schnoebelen
ESSLLI
2009
Springer
13 years 6 months ago
Cdiprover3: A Tool for Proving Derivational Complexities of Term Rewriting Systems
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdip...
Andreas Schnabl
IPPS
2007
IEEE
14 years 3 months ago
Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
Hailiang Mei, Pravin Pawar, Ing Widya
JUCS
2008
144views more  JUCS 2008»
13 years 8 months ago
Embedded Software Revitalization through Component Mining and Software Product Line Techniques
: The mining of generic software components from legacy systems can be used as an auxiliary technique to revitalize systems. This paper presents a software maintenance approach tha...
Marcelo A. Ramos, Rosângela Dellosso Pentead...
INFOCOM
2009
IEEE
14 years 3 months ago
Spatial SINR Games Combining Base Station Placement and Mobile Association
—We study in this paper the question of determining locations of base stations (BSs) that may belong to the same or to competing service providers, taking into account the impact...
Eitan Altman, Anurag Kumar, Chandramani Kishore Si...