Program derivation by fixed point computation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Program Derivation by Fixed Point Computation

Thrs paper develops a transformational paradrgm by which nonnumertcal algorrthms are treated as fixed pomt computatrons derived from very htgh level problem specrficatrons We begin by presenting an abstract functronal problem specrficatron language SQ’, which 1s shown to express any partial recursive function m a fixed pomt normal form Next, we gtce a nondetermuusttc Iterative schema that rn th...

متن کامل

Derivation Tree Analysis for Accelerated Fixed-Point Computation

We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f (X) is equal to the least fixed-point of a linear system obtained by “linearizing” the polynomials of f in a certain way. Our proofs rely on derivation tree analysis, a proof principle that combines methods from algebra, calculus, and formal language theory, and was first use...

متن کامل

Solving Fixed-Point Equations by Derivation Tree Analysis

Systems of equations over ω-continuous semirings can be mapped to context-free grammars in a natural way. We show how an analysis of the derivation trees of the grammar yields new algorithms for approximating and even computing exactly the least solution of the system.

متن کامل

Fast algorithms for weighted myriad computation by fixed-point search

This paper develops fast algorithms to compute the output of the weighted myriad filter. Myriad filters form a large and important class of nonlinear filters for robust non-Gaussian signal processing and communications in impulsive noise environments. Just as the weighted mean and the weighted median are optimized for the Gaussian and Laplacian distributions, respectively, the weighted myriad i...

متن کامل

Secure Computation with Fixed-Point Numbers

Secure computation is a promising approach to business problems in which several parties want to run a joint application and cannot reveal their inputs. Secure computation preserves the privacy of input data using cryptographic protocols, allowing the parties to obtain the benefits of data sharing and at the same time avoid the associated risks. These business applications need protocols that s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science of Computer Programming

سال: 1989

ISSN: 0167-6423

DOI: 10.1016/0167-6423(88)90033-0