MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Automatic Termination." – sorted by Relevance.

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

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

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

ATOM

Automatic Termination Analysis of Logic Programs
by Naomi Lindenstrauss, Yehoshua Sagiv — 1997 — Proceedings of the Fourteenth International Conference on Logic Programming
…Automatic Termination Analysis of Logic Programs Naomi Lindenstrauss and Yehoshua Sagiv…
Cited by 49 (2 self) – Add To MetaCart

Automatic Termination Criteria for Ray Tracing Hierarchies
by Subramanian Donald, K. R. Subramanian, Donald S. Fussell — 1991 — In Proc. of Graphics Interface ’91
…Automatic Termination Criteria for Ray Tracing Hierarchies K. R. Subramanian Donald S. Fussell…
Add To MetaCart

Automatic Termination Proofs for Programs With Shape-Shifting Heaps
by Josh Berdine , Byron Cook, Dino Distefano, Peter W. O’Hearn — 2006
…Automatic termination proofs for programs with shape-shifting heaps Josh Berdine 1 , Byron Cook 1…
Cited by 25 (8 self) – Add To MetaCart

A General Framework for Automatic Termination Analysis of Logic Programs
by Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik — 2000
… is infinite recursion, so it is possible to prove termination automatically for a large class of programs…
Cited by 30 (7 self) – Add To MetaCart

Automatic Termination Analysis for Partial Functions Using Polynomial Orderings
by Jürgen Brauburger — 1997 — In Proc. 4th SAS
…Automatic Termination Analysis for Partial Functions Using Polynomial Orderings ? Jurgen…
Cited by 5 (3 self) – Add To MetaCart

Integrating Types in Abstract Interpretation Based Automatic Termination Analysis of Logic Programs
by Stefaan Decorte, Danny De Schreye, Massimo Fabris
… Integrating Types in Abstract Interpretation Based Automatic Termination Analysis of Logic…
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
…AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework ⋆ Jürgen Giesl, Peter…
Cited by 25 (5 self) – Add To MetaCart

TEA: Automatically proving termination of programs in a non-strict higher-order functional language
by Sven Eric Panitz, Manfred Schmidt-Schauß, Fachbereich Informatik, Johann Wolfgang Goethe-universitat — 1997 — In Proc. 4th Int. Static Analysis Symp
…TEA: Automatically proving termination of programs in a non-strict higher-order functional language…
Cited by 7 (0 self) – Add To MetaCart

Path-Length Analysis for Object-Oriented Programs. Extended version with proofs. Available at www.sci.univr.it/,spoto/papers.html
by Fausto Spoto — 2006 — In Proc. EAAI
… from v. It is shown how such information may be used for automatic termination inference of programs…
Cited by 4 (0 self) – Add To MetaCart

Path-length analysis of object-oriented programs
by Patricia M. Hill, Etienne Payet, Fausto Spoto, Hill@comp. Leeds. Ac. Uk Iremia, Universit'e De La R'eunion — 2006 — In Proc. EAAI
… such information may be used for automatic termination inference of programs dealing with dynamically created data…
Cited by 3 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB