Sciweavers

1147 search results - page 61 / 230
» Termination in language-based systems
Sort
View
RTA
2010
Springer
14 years 20 days ago
Certified Subterm Criterion and Certified Usable Rules
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
Christian Sternagel, René Thiemann
ICWN
2003
13 years 10 months ago
Comparison of Heuristic and Optimal Subcarrier Assignment Algorithms
Wireless multi carrier approaches can support the simultaneous transmissions to several wireless terminals, each one getting only some of the available subcarriers. Judiciously ass...
James Gross, Holger Karl, Frank H. P. Fitzek, Adam...
CONCUR
2004
Springer
14 years 2 months ago
Resource Control for Synchronous Cooperative Threads
We develop new methods to statically bound the resources needed for the execution of systems of concurrent, interactive threads. Our study is concerned with a synchronous model of ...
Roberto M. Amadio, Silvano Dal-Zilio

Publication
234views
14 years 15 days ago
Evolution of Analog Networks using Local String Alignment on Highly Reorganizable Genomes
We introduce and apply a genetic representation for analog electronic circuits based on the association of character strings extracted from the genome with the terminals and param...
Claudio Mattiussi, Dario Floreano
CADE
2007
Springer
14 years 9 months ago
Dependency Pairs for Rewriting with Non-free Constructors
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...
Stephan Falke, Deepak Kapur