Access Restriction

Author Manna, Zohar ♦ Shamir, Adi
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Optimal fixedpoints ♦ Least fixedpoints ♦ Proof techniques ♦ Fixedpoints ♦ Recursive programs
Abstract The classical fixedpoint approach toward recursive programs suggests choosing the “least defined fixedpoint” as the most appropriate solution to a recursive program. A new approach is described which introduces an “optimal fixedpoint,” which, in contrast to the least defined fixedpoint, embodies the maximal amount of valuable information embedded in the program. The practical implications of this approach are discussed and techniques for proving properties of optimal fixedpoints are given. The presentation is informal, with emphasis on examples.
Description Affiliation: Massachusetts Institute of Technology, Cambridge (Shamir, Adi) || Stanford Univ., Stanford, CA (Manna, Zohar)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 20
Issue Number 11
Page Count 8
Starting Page 824
Ending Page 831

Open content in new tab

   Open content in new tab
Source: ACM Digital Library