535 search results - page 18 / 107 » Termination of Abstract Reduction Systems |
FMCAD
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Termination poses one of the main challenges for mechanically verifying infinite state systems. In this paper, we develop a powerful and extensible framework based on th...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
PPDP
2007
Springer
14 years 4 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
CDC
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract— We present a systematic method for model reduction of a class of input-quantized systems in the max-plus algebra. We consider a generalization of the flow shop with ...
CLEF
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In this paper we present the results of BUAP/UPV universities in WebCLEF, a particular task of CLEF 2005. Particularly, we evaluate our information retrieval system at th...