Succinct Representations for Abstract Interpretation

Abstract interpretation techniques can be made more precise by distinguishing paths inside loops, at the expense of possibly exponential complexity. SMT-solving techniques and sparse representations of paths and sets of paths avoid this pitfall. We improve previously proposed techniques for guided static analysis and the generation of disjunctive invariants by combining them with techniques for succinct representations of paths and symbolic representations for transitions based on static single assignment. Because of the non-monotonicity of the results of abstract interpretation with widening operators, it is difficult to conclude that some abstraction is more precise than another based on theoretical local precision results. We thus conducted extensive comparisons between our new techniques and previous ones, on a variety of open-source packages.Comment: Static analysis symposium (SAS), Deauville : France (2012

Structurally Defined Conditional Data-Flow Static Analysis

Data flow analysis (DFA) is an important verification technique that computes the effect of data values propagating over program paths. While more precise than flow-insensitive analyses, such an analysis is time-consuming. This paper investigates the acceleration of DFA by structural decomposition of the underlying control flow graph. Specifically, we explore the cost and effectiveness of dividing program paths into subsets by partitioning path suffixes at conditional statements, applying a DFA on each subset, and then combining the resulting invariants. This yields a family of independent DFA problems that are solved in parallel and where the partial results of each problem represent safe program invariants. Empirical evaluations reveal that depending on the DFA type and its conditional implementation the invariants for a large fraction of program points can be computed in less time than traditional DFA. This work suggests a strategy for an “anytime DFA” algorithm: computing safe program invariants as the analysis proceeds

Using Bounded Model Checking to Focus Fixpoint Iterations

Two classical sources of imprecision in static analysis by abstract interpretation are widening and merge operations. Merge operations can be done away by distinguishing paths, as in trace partitioning, at the expense of enumerating an exponential number of paths. In this article, we describe how to avoid such systematic exploration by focusing on a single path at a time, designated by SMT-solving. Our method combines well with acceleration techniques, thus doing away with widenings as well in some cases. We illustrate it over the well-known domain of convex polyhedra

A simple abstraction of arrays and maps by program translation

We present an approach for the static analysis of programs handling arrays, with a Galois connection between the semantics of the array program and semantics of purely scalar operations. The simplest way to implement it is by automatic, syntactic transformation of the array program into a scalar program followed analysis of the scalar program with any static analysis technique (abstract interpretation, acceleration, predicate abstraction,.. .). The scalars invariants thus obtained are translated back onto the original program as universally quantified array invariants. We illustrate our approach on a variety of examples, leading to the " Dutch flag " algorithm

Climate change affecting oil palm agronomy, and oil palm cultivation increasing climate change, require amelioration

Palm oil is used in various valued commodities and is a large global industry worth over US$ 50 billion annually. Oil palms (OP) are grown commercially in Indonesia and Malaysia and other countries within Latin America and Africa. The large-scale land-use change has high ecological, economic, and social impacts. Tropical countries in particular are affected negatively by climate change (CC) which also has a detrimental impact on OP agronomy, whereas the cultivation of OP increases CC. Amelioration of both is required. The reduced ability to grow OP will reduce CC, which may allow more cultivation tending to increase CC, in a decreasing cycle. OP could be increasingly grown in more suitable regions occurring under CC. Enhancing the soil fauna may compensate for the effect of CC on OP agriculture to some extent. The effect of OP cultivation on CC may be reduced by employing reduced emissions from deforestation and forest degradation plans, for example, by avoiding illegal fire land clearing. Other ameliorating methods are reported herein. More research is required involving good management practices that can offset the increases in CC by OP plantations. Overall, OP-growing countries should support the Paris convention on reducing CC as the most feasible scheme for reducing CC.Portuguese Foundation for Science and Technology (FCT), Grant/Award Number: UID/ BIO/04469/2013, COMPETE 2020 (POCI01-0145-FEDER-006684) and BioTecNorte operation (NORTE-01-0145-FEDER-000004); European Regional Development Fund through Norte2020—Programa Operacional Regional do Norteinfo:eu-repo/semantics/publishedVersio

Characterizing Coherent Wind Structures using Large-Scale Particle Tracking Velocimetry: A Proof-of-Principle Study

The following study proposes a two-dimensional large-scale particle tracking velocimetry (LS-PTV) system to characterize coherent wind structures. Seven minutes of LS-PTV data is collected via an apparatus that seeds fog-filled soap bubbles into the wind at a height of 6m from the ground. The LS-PTV data is compared to 20 minutes of data collected concurrently from a wind mast at the same site. The LS-PTV system recorded a mean streamwise velocity of 1.35m/s with a standard deviation of 0.23m/s at a mean height of 2.50m with a standard deviation of 0.7m, which agrees well with the velocity profile measured by the wind mast. Furthermore, the Reynolds stresses measured by the LS-PTV system are found to compare to those measured by the wind mast and by Klebanoff [1] for a canonical turbulent boundary layer. The current study assumes that the centre-of-curvature trajectories of the particle pathlines are representative of the trajectories followed by the spanwise vortices. As a proof-of-principle study, this work has been successful in accurately describing the vortex distribution very near to the ground. However, the trajectories followed by the centres-of- curvat.ure belonging to pathlines concurrently passing through the field-of-view were sporadic and uncorrelated