… employed regular languages for proving non-termination. … a regular language with properties
from which non-termination … a very simple corresponding regular language is quickly found …

… The culprit of the nontermination of M is the subterm x〈b〉 | b(y)… language we use. First,
the π-calculus is localised, in the sense of Merro (2001); that is, the recipient of a link cannot use …

… Using the above non-termination example, our transformation generates the program on
the right, where changes are indicated in the gray boxed regions. Technically, these changes …

… of programming languages using the algebraic approach [l,4,6,7,l9,20]. One main factor
divides these subject areas as far as the uses of algebra are concerned. This is the use of "…

… proving non-termination of … non-termination proving can be reduced to a question of
underapproximation search guided by a safety prover. This reduction leads to new non-termination …

… To prove non-termination, we use a complete loop checker … an infinite loop, using a new
non-termination condition. We … : our tool is able to prove non-termination and construct non-…

… Non-termination is a crucial problem when encoding unification-based grammar formalisms…
declarative programming is appreciated in language development tasks, where a large …

… handle programs using integer arithmetics. We implemented this non-termination analysis
… of a termination analysis for the programming language Constraint Handling Rules (CHR). …

… and a very expressive functional programming language. In this language, it is possible to
… Since we are also interested in a general treatment of non-termination in type theory, we …

… analysis, by using 𝜔-regular expressions to represent languages of infinite paths and 𝜔-…
and potentially infinite paths, such as non-termination analysis, resource bound analysis, …