scholarly journals Analyzing Runtime Complexity via Innermost Runtime Complexity

10.29007/1nbh ◽  
2018 ◽  
Author(s):  
Florian Frohn ◽  
Jürgen Giesl
Keyword(s):  
Complexity Analysis ◽  
State Of The Art ◽  
Upper Bounds ◽  
The State ◽  
Sufficient Criterion ◽  
Rewrite Systems ◽  
Evaluation Strategy ◽  
Term Rewrite Systems

There exist powerful techniques to infer upper bounds on the innermost runtime complexity of term rewrite systems (TRSs), i.e., on the lengths of rewrite sequences that follow an innermost evaluation strategy. However, the techniques to analyze the (full) runtime complexity of TRSs are substantially weaker. In this paper, we present a sufficient criterion to ensure that the runtime complexity of a TRS coincides with its innermost runtime complexity. This criterion can easily be checked automatically and it allows us to use all techniques and tools for innermost runtime complexity in order to analyze (full) runtime complexity. By extensive experiments with an implementation of our results in the tool AProVE, we show that this improves the state of the art of automated complexity analysis significantly.

scholarly journals On Implementing Modular Complexity Analysis

10.29007/zm9s ◽  
2018 ◽  
Author(s):  
Harald Zankl ◽  
Martin Korp
Keyword(s):  
Complexity Analysis ◽  
Upper Bounds ◽  
Rewrite Systems ◽  
Recent Approach ◽  
Term Rewrite Systems

We recall the recent approach by (Zankl and Korp, 2010) to prove upper bounds on the (derivational) complexity of term rewrite systems modularly. In this note we show that this approach is suitable to tighten bounds after they have been established. The idea is to replace proof steps with a large bound by (new) proofs that yield smaller bounds. An evaluation of the approach shows the benefits.

scholarly journals RDFuzz: Accelerating Directed Fuzzing with Intertwined Schedule and Optimized Mutation

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Jiaxi Ye ◽  
Ruilin Li ◽  
Bin Zhang
Keyword(s):  
Large Scale ◽  
State Of The Art ◽  
The State ◽  
Experimental Results ◽  
Exploration And Exploitation ◽  
Balance Problem ◽  
Evaluation Strategy ◽  
Testing Schedule ◽  
Available Resources

Directed fuzzing is a practical technique, which concentrates its testing energy on the process toward the target code areas, while costing little on other unconcerned components. It is a promising way to make better use of available resources, especially in testing large-scale programs. However, by observing the state-of-the-art-directed fuzzing engine (AFLGo), we argue that there are two universal limitations, the balance problem between the exploration and the exploitation and the blindness in mutation toward the target code areas. In this paper, we present a new prototype RDFuzz to address these two limitations. In RDFuzz, we first introduce the frequency-guided strategy in the exploration and improve its accuracy by adopting the branch-level instead of the path-level frequency. Then, we introduce the input-distance-based evaluation strategy in the exploitation stage and present an optimized mutation to distinguish and protect the distance sensitive input content. Moreover, an intertwined testing schedule is leveraged to perform the exploration and exploitation in turn. We test RDFuzz on 7 benchmarks, and the experimental results demonstrate that RDFuzz is skilled at driving the program toward the target code areas, and it is not easily stuck by the balance problem of the exploration and the exploitation.

scholarly journals A proof-theoretic study of abstract termination principles

2019 ◽  
Vol 29 (8) ◽  
pp. 1345-1366 ◽  
Author(s):  
Thomas Powell
Keyword(s):  
Complexity Analysis ◽  
Theoretic Analysis ◽  
Rewrite Systems ◽  
Abstract Setting ◽  
Term Rewrite Systems ◽  
Recursive Path

Abstract We carry out a proof-theoretic analysis of the wellfoundedness of recursive path orders in an abstract setting. We outline a general termination principle and extract from its wellfoundedness proof subrecursive bounds on the size of derivation trees that can be defined in Gödel’s system T plus bar recursion. We then carry out a complexity analysis of these terms and demonstrate how this can be applied to bound the derivational height of term rewrite systems.

scholarly journals Seeking for the Maximum Symmetric Rank

Mathematics ◽  
2018 ◽  
Vol 6 (11) ◽  
pp. 247 ◽  
Author(s):  
Alessandro De Paris
Keyword(s):  
State Of The Art ◽  
Symmetric Tensor ◽  
Upper Bounds ◽  
The State ◽  
Tensor Rank ◽  
Symmetric Tensors ◽  
Lower And Upper Bounds ◽  
Symmetric Tensor Rank ◽  
Set Up ◽  
Divided Powers

We present the state-of-the-art on maximum symmetric tensor rank, for each given dimension and order. After a general discussion on the interplay between symmetric tensors, polynomials and divided powers, we introduce the technical environment and the methods that have been set up in recent times to find new lower and upper bounds.

Practical Picture Processing

1974 ◽  
Vol 32 ◽  
pp. 338-339
Author(s):  
T. A. Welton
Keyword(s):  
Radiation Damage ◽  
Coherence Length ◽  
Spatial Information ◽  
State Of The Art ◽  
Coherent Radiation ◽  
The State ◽  
Energy Spread ◽  
Electron Micrograph ◽  
Picture Processing ◽  
Molecular Skeleton

Various authors have emphasized the spatial information resident in an electron micrograph taken with adequately coherent radiation. In view of the completion of at least one such instrument, this opportunity is taken to summarize the state of the art of processing such micrographs. We use the usual symbols for the aberration coefficients, and supplement these with £ and 6 for the transverse coherence length and the fractional energy spread respectively. He also assume a weak, biologically interesting sample, with principal interest lying in the molecular skeleton remaining after obvious hydrogen loss and other radiation damage has occurred.

Hypothesis-Evidence Coordination: The State of the Art

2003 ◽  
Vol 48 (6) ◽  
pp. 826-829 ◽  
Author(s):  
Eric Amsel
Keyword(s):  
State Of The Art ◽  
The State

The State of the Art

1968 ◽  
Vol 13 (9) ◽  
pp. 479-480
Author(s):  
LEWIS PETRINOVICH
Keyword(s):  
State Of The Art ◽  
The State

Needs Assessment: The State of the Art

1984 ◽  
Vol 29 (5) ◽  
pp. 426-428
Author(s):  
Anthony R. D'Augelli
Keyword(s):  
Needs Assessment ◽  
State Of The Art ◽  
The State

Biofeedback: The State of the Art

1991 ◽  
Vol 36 (2) ◽  
pp. 140-140
Author(s):  
John A. Corson
Keyword(s):  
State Of The Art ◽  
The State
Sign in / Sign up

Export Citation Format

Share Document