1385 search results - page 79 / 277 » Natural Rewriting for General Term Rewriting Systems |
167
click to vote
RTA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
172
click to vote
ERSHOV
1999
Springer
15 years 10 months ago
1999
Springer
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...
188
click to vote
ESSLLI
2009
Springer
15 years 4 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
151
click to vote
SOFSEM
2010
Springer
15 years 4 months ago
2010
Springer
We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes; the aim is to prove correctness of...
151
click to vote
TSD
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. This paper brings together the development of the first Text-toSpeech (TTS) system for Sinhala using the Festival framework and practical applications of it. Construction...