1147 search results - page 5 / 230 » Termination in language-based systems |
CADE
2009
Springer
14 years 8 months ago
2009
Springer
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
CAISE
2003
Springer
14 years 20 days ago
2003
Springer
Scenarios that describe concrete behaviors of system play an important role in system development and in particular requirements engineering. Scenarios are informal, and are diffic...
LPAR
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
CADE
2004
Springer
14 years 26 days ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
ICSE
1994
IEEE-ACM
13 years 11 months ago
1994
IEEE-ACM
Abstract. Language-based editing systems have the potential to become a practical, central, and powerful part of every software engineer's toolkit, but progress has been limit...