✦ LIBER ✦

On the termination of program schemas

✍ Scribed by A.J. Kfoury; D.M.R. Park

Book ID: 114037168
Publisher: Elsevier Science
Year: 1975
Weight: 381 KB
Volume: 29
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(75)90415-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the non-compactness of the class of p

On the non-compactness of the class of program schemas

✍ Nissim Francez; Giora Slutzky 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 299 KB

New Perspectives on Program Termination

✍ Peter deLeon 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 280 KB

The applicability of program schema resu

The applicability of program schema results to programs

✍ Elaine J. Weyuker 📂 Article 📅 1979 🏛 Springer 🌐 English ⚖ 676 KB

Termination Analysis of Sequential Progr

Termination Analysis of Sequential Program Based on Graph

✍ Yin Jie; Yu Dan; Ye Gang; Ma Shilong 📂 Article 📅 2012 🏛 Elsevier 🌐 English ⚖ 355 KB

Equivalence of conservative, free, linea

Equivalence of conservative, free, linear program schemas is decidable

✍ Michael R. Laurence; Sebastian Danicic; Mark Harman; Rob Hierons; John Howroyd 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 312 KB

A program schema deÿnes a class of programs, all of which have identical statement structures, but whose expressions may di er. We prove that given any two structured schemas which are conservative, linear and free, it is decidable whether they are equivalent.

An Abstract Formalization of Correct Sch

An Abstract Formalization of Correct Schemas for Program Synthesis

✍ Pierre Flener; Kung-Kiu Lau; Mario Ornaghi; Julian Richardson 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 475 KB