Level by level

We present a demand-driven approach to memory leak detection algorithm based on flow- and context-sensitive pointer analysis. The detection algorithm firstly assumes the presence of a memory leak at some program point and then runs a backward analysis to see if this assumption can be disproved. Our algorithm computes the memory abstraction of programs based on points-to graph resulting from flow- and context-sensitive pointer analysis. We have implemented the algorithm in the SUIF2 compiler infrastructure and used the implementation to analyze a set of C benchmark programs. The experimental results show that the approach has better precision with satisfied scalability as expected.

This paper proposes an efficient technique for context-sensitive pointer analysis that is applicable to real C programs. For efficiency, we summarize the effects of procedures using partial transfer functions. A partial transfer function (PTF) describes the behavior of a procedure assuming that certain alias relationships hold when it is called. We can reuse a PTF in many calling contexts as long as the aliases among the inputs to the procedure are the same. Our empirical results demonstrate that this technique is successful—a single PTF per procedure is usually sufficient to obtain completely context-sensitive results. Because many C programs use features such as type casts and pointer arithmetic to circumvent the high-level type system, our algorithm is based on a low-level representation of memory locations that safely handles all the features of C. We have implemented our algorithm in the SUIF compiler system and we show that it runs efficiently for a set of C benchmarks.

Pointer analysis is a prerequisite for many program analyses, and the effectiveness of these analyses depends on the precision of the pointer information they receive. Two major axes of pointer analysis precision are flow-sensitivity and context-sensitivity, and while there has been significant recent progress regarding scalable context-sensitive pointer analysis, relatively little progress has been made in improving the scalability of flow-sensitive pointer analysis.This paper presents a new interprocedural, flow-sensitive pointer analysis algorithm that combines two ideas-semi-sparse analysis and a novel use of BDDs-that arise from a careful understanding of the unique challenges that face flow-sensitive pointer analysis. We evaluate our algorithm on 12 C benchmarks ranging from 11K to 474K lines of code. Our fastest algorithm is on average 197x faster and uses 4.6x less memory than the state of the art, and it can analyze programs that are an order of magnitude larger than the previous state of the art.

Ahstract-Points-to analysis is a fundamental, but computationally intensive technique for static program analysis, optimization, debugging and verification. Context-Free Language (CFL) reachability has been proposed and widely used in demand-driven points-to analyses that aims for computing specific points-to relations on demand rather than all variables in the program. However, CFL-reachability-based points-to analysis still faces challenges when applied in practice especially for flow-sensitive points-to analysis, which aims at improving the precision of points-to analysis by taking account of the execution order of program statements. We propose a scalable approach named Parseeker to parallelize flow-sensitive demand-driven points-to analysis via CFL-reachability in order to improve the performance of points-to analysis with high precision. Our core insights are to (1) produce and process a set of fine-grained, parallelizable queries of points-to relations for the objective program, and (2) take a CFL-reachability-based points-to analysis to answer each query. The MapReduce is used to parallelize the queries and three optimization strategies are designed for further enhancing the efficiency.

High-performance architectures rely upon powerful optimizing and parallelizing compilers to maximize performance. Such compilers need accurate program analysis to enable their performance-enhancing transformations. In the domain of program analysis for parallelization, pointer analysis is a difficult and increasingly common problem. When faced with dynamic, pointer-based data structures, existing solutions are either too limited in the types of data structures they can analyze, or require too much effort on the part of the programmer. In this paper we present a powerful description language for expressing the aliasing properties of dynamic date structures. Such descriptions provide the compiler with better information during alias analysis, and require only minimal effort from the programmer. Ultimately, this enables a more accurate program analysis, and an increased application of performance-enhancing transformations. >

The analytic and functional accuracy of a video densitometry system

Many diseases recur after recovery, for example, recurrences in cancer and infections. However, research is often focused on analysing only time-to-first recurrence, thereby ignoring any subsequent recurrences that may occur after the first. Statistical models for the analysis of recurrent events are available, of which the extended Cox proportional hazards frailty model is the current state-of-the-art. However, this model is too statistically complex for computationally efficient application in high-dimensional data sets, including genome-wide association studies (GWAS). Here, we develop an application for fast and accurate recurrent event analysis in GWAS, called SPARE (SaddlePoint Approximation for Recurrent Event analysis). In SPARE, every DNA variant is tested for association with recurrence risk using a modified score statistic. A saddlepoint approximation is implemented to achieve statistical accuracy. SPARE controls the Type I error, and its statistical power is similar to existing recurrent event models, yet SPARE is significantly faster. An application of SPARE in a recurrent event GWAS on bladder cancer for 6.2 million DNA variants in 1,443 individuals required less than 15 min, whereas existing recurrent event methods would require several weeks.

The lateral dynamics of proteins and lipids in the mammalian plasma membrane are heterogeneous likely reflecting both a complex molecular organization and interactions with other macromolecules that reside outside the plane of the membrane. Several methods are commonly used for characterizing the lateral dynamics of lipids and proteins. These experimental and data analysis methods differ in equipment requirements, labeling complexities, and further oftentimes give different results. It would therefore be very convenient to have a single method that is flexible in the choice of fluorescent label and labeling densities from single molecules to ensemble measurements, that can be performed on a conventional wide-field microscope, and that is suitable for fast and accurate analysis. In this work we show that k-space image correlation spectroscopy (kICS) analysis, a technique which was originally developed for analyzing lateral dynamics in samples that are labeled at high densities, can also be used for fast and accurate analysis of single molecule density data of lipids and proteins labeled with quantum dots (QDs). We have further used kICS to investigate the effect of the label size and by comparing the results for a biotinylated lipid labeled at high densities with Atto647N-strepatvidin (sAv) or sparse densities with sAv-QDs. In this latter case, we see that the recovered diffusion rate is two-fold greater for the same lipid and in the same cell-type when labeled with Atto647N-sAv as compared to sAv-QDs. This data demonstrates that kICS can be used for analysis of single molecule data and furthermore can bridge between samples with a labeling densities ranging from single molecule to ensemble level measurements.

Limitations of the recognition elements in terms of synthesis, cost, availability, and stability have impaired the translation of biosensors into practical use. Inspired by nature to mimic the molecular recognition of the anti-SARS-CoV-2 S protein antibody (AbS) by the S protein binding site, we synthesized the peptide sequence of Asn-Asn-Ala-Thr-Asn-COOH (abbreviated as PEP2003) to create COVID-19 screening label-free (LF) biosensors based on a carbon electrode, gold nanoparticles (AuNPs), and electrochemical impedance spectroscopy. The PEP2003 is easily obtained by chemical synthesis, and it can be adsorbed on electrodes while maintaining its ability for AbS recognition, further leading to a sensitivity 3.4-fold higher than the full-length S protein, which is in agreement with the increase in the target-to-receptor size ratio. Peptide-loaded LF devices based on noncovalent immobilization were developed by affording fast and simple analyses, along with a modular functionalization. From studies by molecular docking, the peptide–AbS binding was found to be driven by hydrogen bonds and hydrophobic interactions. Moreover, the peptide is not amenable to denaturation, thus addressing the trade-off between scalability, cost, and robustness. The biosensor preserves 95.1% of the initial signal for 20 days when stored dry at 4 °C. With the aid of two simple equations fitted by machine learning (ML), the method was able to make the COVID-19 screening of 39 biological samples into healthy and infected groups with 100.0% accuracy. By taking advantage of peptide-related merits combined with advances in surface chemistry and ML-aided accuracy, this platform is promising to bring COVID-19 biosensors into mainstream use toward straightforward, fast, and accurate analyses at the point of care, with social and economic impacts being achieved.

Probabilistic points-to analysis is an analysis technique for defining the probabilities on the points-to relations in programs. It provides the compiler with some optimization chances such as speculative dead store elimination, speculative redundancy elimination, and speculative code scheduling. Although several static probabilistic points-to analysis techniques have been developed for C language, they cannot be applied directly to Java because they do not handle the classes, objects, inheritances and invocations of virtual methods. In this paper, we propose a context-insensitive and flow-sensitive probabilistic points-to analysis for Java (JPPA) for statically predicting the probability of points-to relations at all program points (i.e., points before or after statements) of a Java program. JPPA first constructs an interprocedural control flow graph (ICFG) for a Java program, whose edges are labeled with the probabilities calculated by an algorithm based on a static branch prediction approach, and then calculates the probabilistic points-to relations of the program based upon the ICFG. We have also developed a tool called Lukewarm to support JPPA and conducted an experiment to compare JPPA with a traditional context-insensitive and flow-sensitive points-to analysis approach. The experimental results show that JPPA is a precise and effective probabilistic points-to analysis technique for Java.Keywordspoints-to analysisprobabilityJava

Inclusion-based set constraint solving is the most popular technique for whole-program points-to analysis whereby an analysis is typically formulated as repeatedly resolving constraints between points-to sets of program variables. The set union operation is central to this process. The number of points-to sets can grow as analyses become more precise and input programs become larger, resulting in more time spent performing unions and more space used storing these points-to sets. Most existing approaches focus on improving scalability of precise points-to analyses from an algorithmic perspective and there has been less research into improving the data structures behind the analyses. Bit-vectors as one of the more popular data structures have been used in several mainstream analysis frameworks to represent points-to sets. To store memory objects in bit-vectors, objects need to mapped to integral identifiers. We observe that this object-to-identifier mapping is critical for a compact points-to set representation and the set union operation. If objects in the same points-to sets (co-pointees) are not given numerically close identifiers, points-to resolution can cost significantly more space and time. Without data on the unpredictable points-to relations which would be discovered by the analysis, an ideal mapping is extremely challenging. In this paper, we present a new approach to inclusion-based analysis by compacting points-to sets through object clustering. Inspired by recent staged analysis where an auxiliary analysis produces results approximating a more precise main analysis, we formulate points-to set compaction as an optimisation problem solved by integer programming using constraints generated from the auxiliary analysis’s results in order to produce an effective mapping. We then develop a more approximate mapping, yet much more efficiently, using hierarchical clustering to compact bit-vectors. We also develop an improved representation of bit-vectors (called core bit-vectors) to fully take advantage of the newly produced mapping. Our approach requires no algorithmic change to the points-to analysis. We evaluate our object clustering on flow sensitive points-to analysis using 8 open-source programs (>3.1 million lines of LLVM instructions) and our results show that our approach can successfully improve the analysis with an up to 1.83× speed up and an up to 4.05× reduction in memory usage.

Big Data, Big Expectations, and Big Judgements.

This paper presents a novel technique for the very efficient and accurate two‐dimensional (2‐D) spectral analysis of large cylindrical scatterers with arbitrary geometries using the wavelet and wavelet‐like transform. When such complex problems are solved through an integral equation (IE) technique combined with the method of moments (MOM), a linear equation system with a huge number of unknowns needs to be solved for each incident field. In this work, wavelet bases are successfully proved to expand the integral operator in a very sparse matrix form, thus providing large savings on computational costs and memory storage requirements. Furthermore, the use of the spectral formulation allows us to characterize the scattering behavior of an object for any possible incidence, thus drastically reducing the number of linear equation systems to be solved. Comparative benchmarks between the new wavelet technique and the original approach for solving the scattering of circular cylinders and strips are presented for different orthogonal families: locally supported Daubechies bases, orthogonal quasi‐symmetric Coiflets bases, and wavelet‐like bases. Then the efficient wavelet technique is applied to the accurate characterization of more complex geometries, such as large square cylinders.

In recent years, the trend in program representations for imperative programs has been to make them more functional, or to make them more sparse. However, new sparse representations have been non-functional, and new functional representations have not been sparse in the presence of pointer operations. In this paper, we present a functional representation that is sparse even in the presence of pointer operations.Conventionally, a store is represented in a functional program representation by a single object—typically a mapping from locations to values. We show how such a store object may be fragmented into several objects, each representing part of the store. The result is a sparser representation, which has not only the usual benefit of directly linking producers to consumers, but which also for static program analysis often leads to smaller domains of abstract values for store objects. Store fragmentation corresponds to assignment factored SSA form (a factorization of SSA form introduced in this paper). We report on experiments with a thorough fragmentation based on a data flow points-to analysis and an intermediate level fragmentation based on an almost linear time complexity points-to analysis by type inference.

Quantitative business process analysis is a powerful approach for analyzing timing properties of a business process, such as the expected waiting time of customers or the utilization rate of resources. Multiple techniques are available for quantitative business process analysis, which all have their own advantages and disadvantages. This paper presents a novel technique, based on queueing models, that combines the advantages of existing techniques, in that it leads to accurate analyses, is computationally inexpensive, and feature complete with respect to its support for basic process modeling constructs. An extensive quantitative evaluation has been performed that compares the presented queueing model to existing queueing models from literature. This evaluation shows that the presented model outperforms existing models with one order of magnitude on accuracy. The resulting queueing model can be used for fast and accurate timing predictions of business process models. These properties are useful in optimization scenarios.