Greybox fuzzing time-intensive programs
- URL: http://arxiv.org/abs/2311.17200v1
- Date: Tue, 28 Nov 2023 20:10:38 GMT
- Title: Greybox fuzzing time-intensive programs
- Authors: Steve Huntsman
- Abstract summary: We prototype and evaluate GoExploreFuzz, a greybox fuzzer for time-intensive programs that incorporates this perspective.
The results indicate useful capabilities for greybox fuzzing that have hitherto been underutilized.
- Score: 4.160850625751535
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We examine (directed) greybox fuzzing from a geometrical perspective, viewing
dissimilarities on inputs and on control flow graphs (with dynamical
statistics) as primitive objects of interest. We prototype and evaluate
GoExploreFuzz, a greybox fuzzer for time-intensive programs that incorporates
this perspective. The results indicate useful capabilities for greybox fuzzing
that have hitherto been underutilized, notably quantifying the diversity of
paths and autonomously tuning the "bandwidth" of mutations.
Related papers
- Large Language Model assisted Hybrid Fuzzing [8.603235938006632]
We show how to achieve the effect of concolic execution without having to compute and solve symbolic path constraints.
A Large Language Model (LLM) is used as a solver to generate the modified input for reaching the desired branches.
arXiv Detail & Related papers (2024-12-20T14:23:25Z) - Registration between Point Cloud Streams and Sequential Bounding Boxes via Gradient Descent [21.13347625031356]
We propose an algorithm for registering sequential bounding boxes with point cloud streams.
We show that the proposed method performs remarkably well with a 40% improvement in IoU.
arXiv Detail & Related papers (2024-09-14T05:16:34Z) - Multivariate Time-Series Anomaly Detection based on Enhancing Graph Attention Networks with Topological Analysis [31.43159668073136]
Unsupervised anomaly detection in time series is essential in industrial applications, as it significantly reduces the need for manual intervention.
Traditional methods use Graph Neural Networks (GNNs) or Transformers to analyze spatial while RNNs to model temporal dependencies.
This paper introduces a novel temporal model built on an enhanced Graph Attention Network (GAT) for multivariate time series anomaly detection called TopoGDN.
arXiv Detail & Related papers (2024-08-23T14:06:30Z) - PrescientFuzz: A more effective exploration approach for grey-box fuzzing [0.45053464397400894]
We introduce an approach for improving the early exploration of grey-box fuzzing campaigns.
We use information from the system under test's (SUT's) control flow graph to decide which inputs are likely to lead to discovering most coverage when mutated.
arXiv Detail & Related papers (2024-04-29T17:21:18Z) - Gramformer: Learning Crowd Counting via Graph-Modulated Transformer [68.26599222077466]
Gramformer is a graph-modulated transformer to enhance the network by adjusting the attention and input node features respectively.
A feature-based encoding is proposed to discover the centrality positions or importance of nodes.
Experiments on four challenging crowd counting datasets have validated the competitiveness of the proposed method.
arXiv Detail & Related papers (2024-01-08T13:01:54Z) - Dynamic Graph Message Passing Networks for Visual Recognition [112.49513303433606]
Modelling long-range dependencies is critical for scene understanding tasks in computer vision.
A fully-connected graph is beneficial for such modelling, but its computational overhead is prohibitive.
We propose a dynamic graph message passing network, that significantly reduces the computational complexity.
arXiv Detail & Related papers (2022-09-20T14:41:37Z) - CloudAttention: Efficient Multi-Scale Attention Scheme For 3D Point
Cloud Learning [81.85951026033787]
We set transformers in this work and incorporate them into a hierarchical framework for shape classification and part and scene segmentation.
We also compute efficient and dynamic global cross attentions by leveraging sampling and grouping at each iteration.
The proposed hierarchical model achieves state-of-the-art shape classification in mean accuracy and yields results on par with the previous segmentation methods.
arXiv Detail & Related papers (2022-07-31T21:39:15Z) - Unsupervised Learning of Accurate Siamese Tracking [68.58171095173056]
We present a novel unsupervised tracking framework, in which we can learn temporal correspondence both on the classification branch and regression branch.
Our tracker outperforms preceding unsupervised methods by a substantial margin, performing on par with supervised methods on large-scale datasets such as TrackingNet and LaSOT.
arXiv Detail & Related papers (2022-04-04T13:39:43Z) - Understanding over-squashing and bottlenecks on graphs via curvature [17.359098638324546]
Over-squashing is a phenomenon where the number of $k$-hop neighbors grows rapidly with $k$.
We introduce a new edge-based curvature and prove that negatively curved edges are responsible for over-squashing.
We also propose and experimentally test a curvature-based rewiring method to alleviate the over-squashing.
arXiv Detail & Related papers (2021-11-29T13:27:56Z) - ArTIST: Autoregressive Trajectory Inpainting and Scoring for Tracking [80.02322563402758]
One of the core components in online multiple object tracking (MOT) frameworks is associating new detections with existing tracklets.
We introduce a probabilistic autoregressive generative model to score tracklet proposals by directly measuring the likelihood that a tracklet represents natural motion.
arXiv Detail & Related papers (2020-04-16T06:43:11Z) - Siamese Box Adaptive Network for Visual Tracking [100.46025199664642]
We propose a simple yet effective visual tracking framework (named Siamese Box Adaptive Network, SiamBAN)
SiamBAN directly classifies objects and regresses their bounding boxes in a unified convolutional network (FCN)
SiamBAN achieves state-of-the-art performance and runs at 40 FPS, confirming its effectiveness and efficiency.
arXiv Detail & Related papers (2020-03-15T05:58:12Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.