217 search results - page 20 / 44 » Automatic Termination |
POPL
2012
ACM
12 years 4 months ago
2012
ACM
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
IDEAL
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The importance of modularity in product innovation is analyzed in this paper. Through simulations with an agent-based modular economic model, we examine the significance...
SOFSEM
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
In this paper, we propose a genetic network programming (GNP) architecture using a coevolution model called automatically defined groups (ADG). The GNP evolves networks for describ...
CADE
2003
Springer
14 years 9 months ago
2003
Springer
Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area ...