1147 search results - page 57 / 230 » Termination in language-based systems |
CSL
2004
Springer
14 years 15 days ago
2004
Springer
We consider a scenario where (functional) programs in pre-compiled form are exchanged among untrusted parties. Our contribution is a system of annotations for the code that can be ...
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We present a novel way for reasoning about (possibly ir)rational quantifier-free non-linear arithmetic by a reduction to SAT/SMT. The approach is incomplete and dedicated...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
AAECC
2007
Springer
13 years 9 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
TWC
2008
13 years 8 months ago
2008
1 . Cooperative transmission has emerged as an effective tool to deal with channel impairments. In this work we study the applicability of amplify-and-forward cooperative transmiss...