Calculating Polynomial Runtime Properties
نویسندگان
چکیده
Affine size-change analysis has been used for termination analysis of eager functional programming languages. The same style of analysis is also capable of compactly recording and calculating other properties of programs, including their runtime, maximum stack depth, and (relative) path time costs. In this paper we show how precise (not just big-O) polynomial bounds on such costs may be calculated on programs, by a characterization as a problem in quantifier elimination. The technique is decidable, and complete for a class of size-change terminating programs with limited-degree polynomial costs. An extension to the technique allows the calculation of some classes of exponential-cost programs. We demonstrate the new technique by recording the calculation in numbers-of-function (or procedure) calls for a simple functional definition language, but it can also be applied to imperative languages. The technique is automated within the reduce computer algebra system.
منابع مشابه
Monitoring and Enforcement of Safety Hyperproperties
Certain important security policies such as information flow characterize system-wide behaviors and are not properties of individual executions. It is known that such security policies cannot be expressed in trace-based specification languages such as linear-time temporal logic (Ltl). However, formalisms such as hyperproperties and the associated logic HyperLTL allow us to specify such policies...
متن کاملComputational Properties of Environment-based Disambiguation
The standard pipeline approach to semantic processing, in which sentences are morphologically and syntactically resolved to a single tree before they are interpreted, is a poor fit for applications such as natural language interfaces. This is because the environment information, in the form of the objects and events in the application’s runtime environment, cannot be used to inform parsing deci...
متن کاملStatistical Moments of Polynomial Dimensional Decomposition
This technical note presents explicit formulas for calculating the response moments of stochastic systems by polynomial dimensional decomposition entailing independent random input with arbitrary probability measures. The numerical results indicate that the formulas provide accurate, convergent, and computationally efficient estimates of the second-moment properties. DOI: 10.1061/ ASCE EM.1943-...
متن کاملPopulation Size vs. Runtime of a Simple Evolutionary Algorithm
Evolutionary algorithms (EAs) find numerous applications, and practical knowledge on EAs is immense. In practice, sophisticated population-based EAs employing selection, mutation and crossover are applied. In contrast, theoretical analysis of EAs often concentrates on very simple algorithms such as the (1+1) EA, where the population size equals 1. In this paper, the question is addressed whethe...
متن کاملSecond-Order Polynomial Expressions for On-Chip Interconnect Capacitance
Simple closed-form expressions for efficiently calculating on-chip interconnect capacitances are presented. The formulas are expressed with second-order polynomial functions which do not include exponential functions. The runtime of the proposed formulas is about 2–10 times faster than those of existing formulas. The root mean square (RMS) errors of the proposed formulas are within 1.5%, 1.3%, ...
متن کامل