Searcharxiv⌕ Search

arXiv subjects

Saikat Chakraborty

Publications and source records attributed to Saikat Chakraborty.

At least 73 records · Page 4Linked to original sources

Deep Learning based Vulnerability Detection: Are We There Yet?

Automated detection of software vulnerabilities is a fundamental problem in software security. Existing program analysis techniques either suffer from high false positives or false negatives. Recent progress in Deep Learning (DL) has resulted in a surge of interest in applying DL for automated vulnerability detection. Several recent studies have demonstrated promising results achieving an accuracy of up to 95% at detecting vulnerabilities. In this paper, we ask, "how well do the state-of-the-art DL-based techniques perform in a real-world vulnerability prediction scenario?". To our surprise, we find that their performance drops by more than 50%. A systematic investigation of what causes such precipitous performance drop reveals that existing DL-based vulnerability prediction approaches suffer from challenges with the training data (e.g., data duplication, unrealistic distribution of vulnerable classes, etc.) and with the model choices (e.g., simple token-based models). As a result, these approaches often do not learn features related to the actual cause of the vulnerabilities. Instead, they learn unrelated artifacts from the dataset (e.g., specific variable/function names, etc.). Leveraging these empirical findings, we demonstrate how a more principled approach to data collection and model design, based on realistic settings of vulnerability prediction, can lead to better solutions. The resulting tools perform significantly better than the studied baseline: up to 33.57% boost in precision and 128.38% boost in recall compared to the best performing model in the literature. Overall, this paper elucidates existing DL-based vulnerability prediction systems' potential issues and draws a roadmap for future DL-based vulnerability prediction research. In that spirit, we make available all the artifacts supporting our results: https://git.io/Jf6IA.

cs.SE↗

CODIT: Code Editing with Tree-Based Neural Models

The way developers edit day-to-day code tends to be repetitive, often using existing code elements. Many researchers have tried to automate repetitive code changes by learning from specific change templates which are applied to limited scope. The advancement of deep neural networks and the availability of vast open-source evolutionary data opens up the possibility of automatically learning those templates from the wild. However, deep neural network based modeling for code changes and code in general introduces some specific problems that needs specific attention from research community. For instance, compared to natural language, source code vocabulary can be significantly larger. Further, good changes in code do not break its syntactic structure. Thus, deploying state-of-the-art neural network models without adapting the methods to the source code domain yields sub-optimal results. To this end, we propose a novel tree-based neural network system to model source code changes and learn code change patterns from the wild. Specifically, we propose a tree-based neural machine translation model to learn the probability distribution of changes in code. We realize our model with a change suggestion engine, CODIT, and train the model with more than 24k real-world changes and evaluate it on 5k patches. Our evaluation shows the effectiveness of CODITin learning and suggesting patches. CODIT can also learn specific bug fix pattern from bug fixing patches and can fix 25 bugs out of 80 bugs in Defects4J.

cs.SE↗

Relaxation in a Phase-separating Two-dimensional Active Matter System with Alignment Interaction

Via computer simulations we study kinetics of pattern formation in a two-dimensional active matter system. Self-propulsion in our model is incorporated via the Vicsek-like activity, i.e., particles have the tendency of aligning their velocities with the average directions of motion of their neighbors. In addition to this dynamic or active interaction, there exists passive inter-particle interaction in the model for which we have chosen the standard Lennard-Jones form. Following quenches of homogeneous configurations to a point deep inside the region of coexistence between high and low density phases, as the systems exhibit formation and evolution of particle-rich clusters, we investigate properties related to the morphology, growth and aging. A focus of our study is on the understanding of the effects of structure on growth and aging. To quantify the latter we use the two-time order-parameter autocorrelation function. This correlation, as well as the growth, is observed to follow power-law time dependence, qualitatively similar to the scaling behavior reported for passive systems. The values of the exponents have been estimated and discussed by comparing with the previously obtained numbers for other dimensions as well as with the new results for the passive limit of the considered model. We have also presented results on the effects of temperature on the activity mediated phase separation.

cond-mat.soft↗

A Transformer-based Approach for Source Code Summarization

Generating a readable summary that describes the functionality of a program is known as source code summarization. In this task, learning code representation by modeling the pairwise relationship between code tokens to capture their long-range dependencies is crucial. To learn code representation for summarization, we explore the Transformer model that uses a self-attention mechanism and has shown to be effective in capturing long-range dependencies. In this work, we show that despite the approach is simple, it outperforms the state-of-the-art techniques by a significant margin. We perform extensive analysis and ablation studies that reveal several important findings, e.g., the absolute encoding of source code tokens' position hinders, while relative encoding significantly improves the summarization performance. We have made our code publicly available to facilitate future research.

cs.SE↗

A Graph-based Ranking Approach to Extract Key-frames for Static Video Summarization

Video abstraction has become one of the efficient approaches to grasp the content of a video without seeing it entirely. Key frame-based static video summarization falls under this category. In this paper, we propose a graph-based approach which summarizes the video with best user satisfaction. We treated each video frame as a node of the graph and assigned a rank to each node by our proposed VidRank algorithm. We developed three different models of VidRank algorithm and performed a comparative study on those models. A comprehensive evaluation of 50 videos from open video database using objective and semi-objective measures indicates the superiority of our static video summary generation method.

cs.MM↗

Initial Correlation Dependence of Aging in Phase Separating Solid Binary Mixtures and Ordering Ferromagnets

Following quenches of initial configurations having long range spatial correlations, prepared at the demixing critical point, to points inside the miscibility gap, we study aging phenomena in solid binary mixtures. Results on the decay of the two-time order-parameter autocorrelation functions, obtained from Monte Carlo simulations of the two-dimensional Ising model, with Kawasaki exchange kinetics, are analyzed via state-of-the art methods. The outcome is compared with that obtained for the ordering in uniaxial ferromagnets. For the latter, we have performed Monte Carlo simulations of the same model using the Glauber mechanism. For both types of systems we provide comparative discussion of our results with reference to those concerning quenches with configurations having no spatial correlation. We also discuss the role of structure on the decay of these correlations.

cond-mat.stat-mech↗

Dynamical properties of Bianchi-I spacetimes in $f(R)$ gravity

We present a dynamical analysis in terms of new expansion-normalized variables for homogeneous and anisotropic Bianchi-I spacetimes in $f(R)$ gravity in the presence of anisotropic matter. With a suitable choice of the evolution parameter, the Einstein's equations are reduced to an autonomous 5-dimensional system of ordinary differential equations for the new variables. Further restrictions lead to considerable simplifications. For instance, we show that for a large class of functions $f(R)$, which includes several cases commonly considered in the literature, all the fixed points are polynomial roots, and hence they can be determined with good accuracy and classified for stability. Moreover, typically for these cases, any fixed point corresponding to isotropic solutions in the presence of anisotropic matter will be unstable. The assumption of a perfect fluid as source and or the vacuum cases imply some dimensional reductions and even more simplifications. In particular, we find that the vacuum solutions of $f(R) = R^{1+δ}$, with $δ$ a constant, are governed by an effective bi-dimensional phase space which can be analytically constructed, leading to an exactly soluble dynamics. Finally, we demonstrate that several results already reported in the literature can be re-obtained in a more direct and easy way by exploring our dynamical formulation.

gr-qc↗

Nonlinear anisotropy growth in Bianchi-I spacetime in metric $f(R)$ cosmology

The present work is related to anisotropic cosmological evolution in metric $f(R)$ theory of gravity. The initial part of the paper develops the general cosmological dynamics of homogeneous anisotropic Bianchi-I spacetime in $f(R)$ cosmology. The anisotropic spacetime is pervaded by a barotropic fluid which has isotropic pressure. The paper predicts nonlinear growth of anisotropy in such spacetimes. In the later part of the paper we display the predictive power of the nonlinear differential equation responsible for the cosmological anisotropy growth in various relevant cases. We present the exact solutions of anisotropy growth in Starobinsky inflation driven by quadratic gravity and exponential gravity theory. Semi-analytical results are presented for the contraction phase in quadratic gravity bounce. The various examples of anisotropy growth in Bianchi-I model universe shows the complex nature of the problem at hand.

gr-qc↗

Dynamical equivalence of $f(R)$ gravity in Jordan and Einstein frames

We investigate the dynamics of $f(R)$ gravity in Jordan and Einstein frames. First, we perform a phase-space singularities analysis in both frames. We show that, typically, anisotropic singularities are absent in the Einstein frame, whereas they may appear in the Jordan frame. We conciliate this apparent inconsistency by showing that the necessary conditions for the existence of the Einstein frame are namely the same ones assuring the absence of the anisotropic singularities in the Jordan frame. In other words, we show that, at least in the context of Bianchi I cosmologies, the Einstein frame is available only when the original formulation in the Jordan frame is free of anisotropic singularities. Furthermore, we present a novel dynamical system formulation for anisotropic cosmologies in which both frames, provided they exist, will be manifestly equivalent from the dynamical point of view, even though they fail to be diffeomorphic in general. Our results could help not only the construction of viable (free of anisotropic singularities) $f(R)$ cosmological models, but also contribute to the still active debate on the physical interpretation of the two frames.

gr-qc↗

Early universe cosmological solutions in exponential gravity

In this work we present some cosmologically relevant solutions using the spatially flat Friedmann-Lemaitre-Robertson-Walker (FLRW) spacetime in metric $f(R)$ gravity where the form of the gravitational Lagrangian is given by $\frac{1}αe^{αR}$. In the low curvature limit this theory reduces to ordinary Einstein-Hilbert Lagrangian together with a cosmological constant term. Precisely because of this cosmological constant term this theory of gravity is able to support nonsingular bouncing solutions in both matter and vacuum background. Since for this theory of gravity $f^{\prime}$ and $f^{\prime\prime}$ is always positive, this is free of both ghost instability and tachyonic instability. Moreover, because of the existence of the cosmological constant term, this gravity theory also admits a de-Sitter solution. Lastly we hint towards the possibility of a new type of cosmological solution that is possible only in higher derivative theories of gravity like this one.

gr-qc↗

Causal horizons in a bouncing universe

As our understanding of the past in a bouncing universe is limited, it becomes difficult to propose a cosmological model which can give some understanding of the causal structure of the bouncing universe. In this article we address the issue related to the particle horizon problem in the bouncing universe models. It is shown that in many models the particle horizon does not exist, and consequently the horizon problem is trivially solved. In some cases a bouncing universe can have a particle horizon and we specify the conditions for its existence. In the absence of a particle horizon the Hubble surface specifies the causal structure of a bouncing universe. We specify the complex relationship between the Hubble surface and the particle horizon when the particle horizon exists. The article also address the issue related to the event horizon in a bouncing universe. A toy example of a bouncing universe is first presented where we specify the conditions which dictate the presence of a particle horizon. Next we specify the causal structures of three widely used bouncing models. The first case is related to quintom matter bounce model, the second one is loop quantum cosmology based bounce model and lastly $f(R)$ gravity induced bounce model. We present a brief discussion on the horizon problem in bouncing cosmologies. We point out that the causal structure of the various bounce models fit our general theoretical predictions.

gr-qc↗

A Case Study on the Impact of Similarity Measure on Information Retrieval based Software Engineering Tasks

Information Retrieval (IR) plays a pivotal role in diverse Software Engineering (SE) tasks, e.g., bug localization and triaging, code retrieval, requirements analysis, etc. The choice of similarity measure is the core component of an IR technique. The performance of any IR method critically depends on selecting an appropriate similarity measure for the given application domain. Since different SE tasks operate on different document types like bug reports, software descriptions, source code, etc. that often contain non-standard domain-specific vocabulary, it is essential to understand which similarity measures work best for different SE documents. This paper presents two case studies on the effect of different similarity measure on various SE documents w.r.t. two tasks: (i) project recommendation: finding similar GitHub projects and (ii) bug localization: retrieving buggy source file(s) correspond to a bug report. These tasks contain a diverse combination of textual (i.e. description, readme) and code (i.e. source code, API, import package) artifacts. We observe that the performance of IR models varies when applied to different artifact types. We find that, in general, the context-aware models achieve better performance on textual artifacts. In contrast, simple keyword-based bag-of-words models perform better on code artifacts. On the other hand, the probabilistic ranking model BM25 performs better on a mixture of text and code artifacts. We further investigate how such an informed choice of similarity measure impacts the performance of SE tools. In particular, we analyze two previously proposed tools for project recommendation and bug localization tasks, which leverage diverse software artifacts, and observe that an informed choice of similarity measure indeed leads to improved performance of the existing SE tools.

cs.SE↗

Finite-Size Scaling Study of Aging during Coarsening in Non-Conserved Ising Model: The case of zero temperature quench

Following quenches from random initial configurations to zero temperature, we study aging during evolution of the ferromagnetic (nonconserved) Ising model towards equilibrium, via Monte Carlo simulations of very large systems, in space dimensions $d=2$ and $3$. Results for the two-time autocorrelations, obtained by using different acceptance probabilities for the spin-flip trial moves, are in agreement with each other. We demonstrate the scaling of this quantity with respect to $\ell/\ell_w$, where $\ell$ and $\ell_w$ are the average domain sizes at $t$ and $t_w$ $(\leqslant t)$, the observation and waiting times, respectively. The scaling functions are shown to be of power-law type for $\ell/\ell_{w} \rightarrow \infty$. The exponents of these power-laws have been estimated via the finite-size scaling analyses and discussed with reference to the available results from non-zero temperatures. While in $d=2$ we do not observe any temperature dependence, in the case of $d=3$ the outcome for quench to zero temperature is very different from the available results for high temperature and violates a lower bound, which we explain via structural consideration. We also present results on the freezing phenomena that this model exhibits at zero temperature. Furthermore, from simulations of extremely large system, thereby avoiding the freezing effect, it has been confirmed that the growth of average domain size in $d=3$, that remained a puzzle in the literature, follows the Lifshitz-Allen-Cahn law in the asymptotic limit.

cond-mat.stat-mech↗

Building Language Models for Text with Named Entities

Text in many domains involves a significant amount of named entities. Predict- ing the entity names is often challenging for a language model as they appear less frequent on the training corpus. In this paper, we propose a novel and effective approach to building a discriminative language model which can learn the entity names by leveraging their entity type information. We also introduce two benchmark datasets based on recipes and Java programming codes, on which we evalu- ate the proposed model. Experimental re- sults show that our model achieves 52.2% better perplexity in recipe generation and 22.06% on code generation than the state-of-the-art language models.

cs.CL↗

Reconstruction method of $f(R)$ gravity for isotropic and anisotropic spacetimes

We present the reconstruction method of $f(R)$ gravity for the homogeneous and anisotropic Bianchi-I spacetime, which was previously formulated only for homogeneous and isotropic FLRW spacetime. We argue in this paper that for anisotropic spacetimes, the total anisotropy behaves as an independent metric degree of freedom on top of the average scale factor in $f(R)$ gravity. This is not like $GR$, where specifying the form of the average scale factor as a function of time also specify the total anisotropy as a function of time uniqely. We link this peculiar fact to an interesting intertwining between the definition of Ricci scalar for anisotropic metric and anisotropy evolution equation in $f(R)$ gravity. Consequently, specifying an anisotropic solution of $f(R)$ gravity implies specifying both the average scale factor and the total anisotropy as functions of time. The reconstruction method hence formulated is applied to two scenarios where anisotropy suppression is important, namely, a quasi de-Sitter expansion as required in inflation, and a power law contraction as required in ekpyrotic bounce models.

gr-qc↗

Entropy Guided Spectrum Based Bug Localization Using Statistical Language Model

Locating bugs is challenging but one of the most important activities in software development and maintenance phase because there are no certain rules to identify all types of bugs. Existing automatic bug localization tools use various heuristics based on test coverage, pre-determined buggy patterns, or textual similarity with bug report, to rank suspicious program elements. However, since these techniques rely on information from single source, they often suffer when the respective source information is inadequate. For instance, the popular spectrum based bug localization may not work well under poorly written test suite. In this paper, we propose a new approach, EnSpec, that guides spectrum based bug localization using code entropy, a metric that basically represents naturalness of code derived from a statistical language model. Our intuition is that since buggy code are high entropic, spectrum based bug localization with code entropy would be more robust in discriminating buggy lines vs. non-buggy lines. We realize our idea in a prototype, and performed an extensive evaluation on two popular publicly available benchmarks. Our results demonstrate that EnSpec outperforms a state-of-the-art spectrum based bug localization technique.

cs.SE↗

Coarsening in 3D Nonconserved Ising Model at Zero Temperature: Anomalies in structure and relaxation of order-parameter autocorrelation

Via Monte Carlo simulations we study pattern and aging during coarsening in nonconserved nearest neighbor Ising model, following quenches from infinite to zero temperature, in space dimension $d=3$. The decay of the order-parameter autocorrelation function is observed to obey a power-law behavior in the long time limit. However, the exponent of the power-law, estimated accurately via a state-of-art method, violates a well-known lower bound. This surprising fact has been discussed in connection with a quantitative picture of the structural anomaly that the 3D Ising model exhibits during coarsening at zero temperature. These results are compared with those for quenches to a temperature above that of the roughening transition.

cond-mat.stat-mech↗

Kinetics of Ferromagnetic Ordering in 3D Ising Model: Do we understand the case of zero temperature quench?

We study phase ordering dynamics in the three-dimensional nearest-neighbor Ising model, following rapid quenches from infinite to zero temperature. Results on various aspects, viz., domain growth, persistence, aging and pattern, have been obtained via the Glauber Monte Carlo simulations of the model on simple cubic lattice. These are analyzed via state-of-the-art methods, including the finite-size scaling, and compared with those for quenches to a temperature above the roughening transition. Each of these properties exhibit remarkably different behavior at the above mentioned final temperatures. Such a temperature dependence is absent in the two-dimensional case for which there is no roughening transition.

cond-mat.stat-mech↗