437 search results - page 59 / 88 » Proving Termination by Divergence |
CADE
2006
Springer
14 years 8 months ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
CADE
2003
Springer
14 years 8 months ago
2003
Springer
In this paper we present a translation principle, called the axiomatic translation, for reducing propositional modal logics with background theories, including triangular propertie...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
FASE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Though there has been nearly three decades of work on program slicing, there has been comparatively little work on slicing for state machines. One of the primary challeng...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...