Searching for "Proving non-termination." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

13 documents found, showing 1 through 10. Next 10 →

Proving and Disproving Termination of Higher-Order Functions
by Jürgen Giesl, René Thiemann, Peter Schneider-Kamp — 2005 — IN: PROC. 5TH FROCOS
… technique is extended to handle (untyped) applicative TRSs. Second, we introduce a method to prove non-termination…
Cited by 18 (8 self) – Add To MetaCart

A Generic Rewrite Method for Proving Self-Stabilization
by J. Beauquier, B. Bérard, L. Fribourg, Joffroy Beauquier, Laurent Fribourg — 1998
…, and adapts a procedure initially designed by Dershowitz for proving (non)termination of string rewrite…
Add To MetaCart

Non-Termination Checking for Imperative Programs
by Helga Velroyen
… development. Showing the non-termination of a program consists of two parts: (i) to prove that a potential…
Add To MetaCart

AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework
by Jürgen Giesl, Peter Schneider-kamp, René Thiemann — 2006 — In Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR ’06
… is needed to prove non-termination (in particular, to conclude that d is infinite if Proc(d) = no). So…
Cited by 29 (5 self) – Add To MetaCart

On Operational Termination of Deterministic Conditional Rewrite Systems ⋆
by Felix Schernhammer, Bernhard Gramlich
… approaches before. On the other hand, as proving non-termination on original terms may be significantly…
Add To MetaCart

Static Properties of Commercial Embedded Real-Time Programs, and Their Implication for Worst-Case Execution Time Analysis
by Jakob Engblom — 1999
… be handled reliably only by putting a bound on the analysis time, since proving non-termination in general…
Cited by 15 (1 self) – Add To MetaCart

Deciding Innermost Loops ⋆
by René Thiemann, Jürgen Giesl, Peter Schneider-kamp
… to detect bugs in programs, it is at least as important to prove non-termination of programs…
Add To MetaCart

Object-Oriented Programming in Explicit Mathematics: Towards the Mathematics of Objects
by Thomas Studer von Werthenstein, Der Philosophisch-naturwissenschaftlichen Fakultät, Leiter Der Arbeit, Thomas Studer, Thomas Studer, Der Universität Bern, Der Universität Bern, Prof Dr, Prof Dr, G. Jäger, G. Jäger, Der Dekan — 2001
… overloading is dealt with in Chapter 4. An applicative theory that allows us to prove the non-termination…
Add To MetaCart

Principles of proving concurrent programs in Gypsy
by Donald I. Good, Richard M. Cohen, James Keeton-williams, Donald I. Good, Richard M. Cohen, James Keeton-williams — 1979 — In Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages
… we turn our attention to the special problem of specifying and proving non-terminating processes…
Cited by 11 (0 self) – Add To MetaCart

Termination of string rewriting proved automatically
by H. Zantema — 2003 — Journal of Automated Reasoning
… rules, RFC-match-bounds provide the most powerful technique. For proving non-termination only one…
Cited by 10 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB