1147 search results - page 133 / 230 » Termination in language-based systems |
108
Voted
CADE
2006
Springer
16 years 1 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
2002
Springer
16 years 1 months ago
2002
Springer
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
PERCOM
2006
ACM
16 years 9 days ago
2006
ACM
One of the challenges in pervasive computing is communication between a mobile user's terminal and the continuously changing local environment. Bluetooth is one potential opt...
103
click to vote
SOFSEM
2010
Springer
15 years 9 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...
107
Voted
FASE
2009
Springer
15 years 7 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...