Static Loop Bound Analysis of C Programs Based on Flow Analysis and Abstract Interpretation

2008 ◽  
Author(s):  
Marianne de Michiel ◽  
Armelle Bonenfant ◽  
Hugues Casse ◽  
Pascal Sainrat
Keyword(s):  
Abstract Interpretation ◽  
Flow Analysis ◽  
C Programs ◽  
Loop Bound ◽  
Bound Analysis

scholarly journals Exploiting reachability and cardinality in higher-order flow analysis

2008 ◽  
Vol 18 (5-6) ◽  
pp. 821-864 ◽  
Author(s):  
MATTHEW MIGHT ◽  
OLIN SHIVERS
Keyword(s):  
Abstract Interpretation ◽  
Garbage Collection ◽  
Flow Analysis ◽  
Higher Order ◽  
Order Flow ◽  
Environment Analysis ◽  
Running Time

AbstractWe present two complementary improvements for abstract-interpretation-based flow analysis of higher-order languages: (1) abstract garbage collection and (2) abstract counting. Abstract garbage collection is an analog to its concrete counterpart: the analysis determines when an abstract resource has become unreachable, and then, re-allocates it as fresh. This prevents flow sets from joining during abstract interpretation, which has two immediate effects: (1) the precision of the interpretation increases and (2) its running time often falls. In abstract counting, the analysis tracks how many times an abstract resource has been allocated. A count of one implies that the abstract resource momentarily represents only one concrete resource. This knowledge, in turn, drives environment analysis, expanding the kind (rather than just the degree) of optimization available to the compiler.

scholarly journals Fitness Conditions for fixed Point Iteration

1992 ◽  
Vol 21 (384) ◽  
Author(s):  
Flemming Nielson ◽  
Hanne Riis Nielson
Keyword(s):  
Fixed Point ◽  
Abstract Interpretation ◽  
Flow Analysis ◽  
Worst Case ◽  
Fixed Point Iteration ◽  
Average Case ◽  
Data Flow Analysis ◽  
Tail Recursion ◽  
Carry Over ◽  
Primitive Recursive

This paper provides a link between the formulation of static program analyses using the framework of abstract interpretation (popular for functional languages) and using the more classical framework of data flow analysis (popular for imperative languages). In particular we show how the classical notions of fastness, rapidity and k-boundedness carry over to the abstract interpretation framework and how this may be used to bound the number of times a functional should be unfolded in order to yield the fixed point. This is supplemented with a number of results on how to calculate the bounds for iterative forms (as for tail recursion), for linear forms (as for one nested recursive call), and for primitive recursive forms. In some cases this improves the ''worst case'' results of H.R. Nielson and F. Nielson: Bounded Fixed Point Iteration, but more importantly it gives much better ''average case'' results.

scholarly journals Goblint: Thread-Modular Abstract Interpretation Using Side-Effecting Constraints

2021 ◽  
pp. 438-442
Author(s):  
Simmo Saan ◽  
Michael Schwarz ◽  
Kalmer Apinis ◽  
Julian Erhard ◽  
Helmut Seidl ◽  
...  
Keyword(s):  
Static Analysis ◽  
Abstract Interpretation ◽  
Analysis Framework ◽  
Data Race ◽  
C Programs ◽  
Global Invariants ◽  
Race Analysis

AbstractGoblintis a static analysis framework for C programs specializing in data race analysis. It relies on thread-modular abstract interpretation where thread interferences are accounted for by means of flow-insensitive global invariants.

scholarly journals ImReMuDF: Redundant Mutants Identification Method Based on Definition and Reference of Variables

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Zhenpeng Liu ◽  
Xianwei Yang ◽  
Yi Liu ◽  
Yonggang Zhao ◽  
Xiaofei Li
Keyword(s):  
Flow Analysis ◽  
Mutation Testing ◽  
Industrial Engineering ◽  
Data Flow Analysis ◽  
Identification Rate ◽  
C Programs ◽  
Identification Method ◽  
Maximum Improvement ◽  
Mutant Identification ◽  
The Cost

Mutation testing is an effective defect-based software testing method, but a large number of mutants lead to expensive testing costs, which hinders the application of variation testing in industrial engineering. To solve this problem and enable mutation testing to be applied in industrial engineering, this paper improves the method of identifying redundant mutants based on data flow analysis and proposes the inclusion relationship between redundant mutants, so that the redundancy rate of mutants is reduced. In turn, the cost of mutation testing can be reduced. The redundant mutants identification method based on definition and reference of variables (ImReMuDF) was validated and evaluated using 8 C programs. The minimum improvement in redundant mutant identification rate was 34.0%, and the maximum improvement was 71.3% in the 8 C programs tested, and the verification results showed that the method is feasible and effective and has been improved in reducing redundant mutants and effectively reducing the execution time of mutation testing.

Sign in / Sign up

Export Citation Format

Share Document