✦ LIBER ✦

Formalizing non-termination of recursive programs

✍ Scribed by Reinhard Kahle; Thomas Studer

Book ID: 114414899
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 135 KB
Volume: 49
Category: Article
ISSN: 1567-8326
DOI: 10.1016/s1567-8326(01)00006-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Termination of well-moded programs

✍ S. Etalle; A. Bossi; N. Cocco 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 1001 KB

We study the termination properties of well-moded programs, and we show thz, t. under suitable conditions, for these programs there exists an algebraic characteriza zion -in the style of Apt and Pedreschi, Studies in pure prolog: termination, in: J.W. Lloyd ted.), Proceedings of the Simposium in Com

Termination of nondeterministic quantum

Termination of nondeterministic quantum programs

✍ Li, Yangjia; Yu, Nengkun; Ying, Mingsheng 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 285 KB

Termination of Nested and Mutually Recur

Termination of Nested and Mutually Recursive Algorithms

✍ Jürgen Giesl 📂 Article 📅 1997 🏛 Springer Netherlands 🌐 English ⚖ 290 KB

Formalization of correctness of recursiv

Formalization of correctness of recursive definitions

✍ Tsong Yueh Chen 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 285 KB

The automatic synthesis of recursive pro

The automatic synthesis of recursive programs

✍ Manna, Zohar; Waldinger, Richard 📂 Article 📅 1977 🏛 Association for Computing Machinery ⚖ 653 KB

We describe a deductive technique for the automatic construction of recursive programs to meet given input-output specifications. These specifications express what conditions the output of the desired program is expected to satisfy. The deductive technique involves transforming the specifications by

Formalization of equivalence of recursiv

Formalization of equivalence of recursively defined functions

✍ Tsong Yueh Chen 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 418 KB