Modified Condition/Decision Coverage in the GNU Compiler Collection

• URL: http://arxiv.org/abs/2501.02133v1
• Date: Fri, 03 Jan 2025 22:59:38 GMT
• Title: Modified Condition/Decision Coverage in the GNU Compiler Collection
• Authors: Jørgen Kvalsvik,
• Abstract summary: We describe the implementation of the masking Modified Condition/Decision Coverage (MC/DC) support in GCC 14. By analyzing the Binary Decision Diagrams we can observe the key property of MC/DC, the power to independently affect the outcome, and map to the edges of the Control Flow Graph.
• Score: 0.0
• License:
• Abstract: We describe the implementation of the masking Modified Condition/Decision Coverage (MC/DC) support in GCC 14, a powerful structural coverage metric with wide industry adoption for safety critical applications. By analyzing the structure of Boolean expressions with Binary Decision Diagrams we can observe the key property of MC/DC, the power to independently affect the outcome, and map to the edges of the Control Flow Graph. This mapping can be translated to a few bitwise instructions and enables GCC to instrument programs to efficiently observe and record when conditions have been taken and have an independent effect on the outcome of a decision. By analyzing the BDD rather than the program syntax, GCC can measure MC/DC for almost all of its languages with a single language-agnostic implementation, including support for C, C++, D, and Rust.

Related papers

• StructTest: Benchmarking LLMs' Reasoning through Compositional Structured Outputs [78.84060166851805]
  StructTest is a novel benchmark that evaluates large language models on their ability to produce structured outputs. We demonstrate that StructTest serves as a good proxy for general reasoning abilities.
  arXiv  Detail & Related papers  (2024-12-23T22:08:40Z)
• Annotating Control-Flow Graphs for Formalized Test Coverage Criteria [0.3277163122167433]
  We show how to annotate a Control-Flow Graph with decision information inferred from the graph itself. We have implemented our algorithms in a tool which we show can be applied to automatically annotate CFGs output from popular compilers.
  arXiv  Detail & Related papers  (2024-07-04T20:13:03Z)
• FoC: Figure out the Cryptographic Functions in Stripped Binaries with LLMs [54.27040631527217]
  We propose a novel framework called FoC to Figure out the Cryptographic functions in stripped binaries. We first build a binary large language model (FoC-BinLLM) to summarize the semantics of cryptographic functions in natural language. We then build a binary code similarity model (FoC-Sim) upon the FoC-BinLLM to create change-sensitive representations and use it to retrieve similar implementations of unknown cryptographic functions in a database.
  arXiv  Detail & Related papers  (2024-03-27T09:45:33Z)
• Accurate Coverage Metrics for Compiler-Generated Debugging Information [0.0]
  Many tools rely on compiler-produced metadata to present a source-language view of program states. Current approaches for measuring the extent of coverage of local variables are based on crude assumptions. We propose some new metrics, computable by our tools, which could serve as motivation for language implementations to improve debug quality.
  arXiv  Detail & Related papers  (2024-02-07T13:01:28Z)
• C Analyzer : A Static Program Analysis Tool for C Programs [0.0]
  C Analyzer is a tool developed for static analysis of C programs. This project work tries to leverage Abstract Interpretation techniques for static analysis of C programs.
  arXiv  Detail & Related papers  (2024-01-28T11:43:16Z)
• Contextualization Distillation from Large Language Model for Knowledge Graph Completion [51.126166442122546]
  We introduce the Contextualization Distillation strategy, a plug-in-and-play approach compatible with both discriminative and generative KGC frameworks. Our method begins by instructing large language models to transform compact, structural triplets into context-rich segments. Comprehensive evaluations across diverse datasets and KGC techniques highlight the efficacy and adaptability of our approach.
  arXiv  Detail & Related papers  (2024-01-28T08:56:49Z)
• CP-BCS: Binary Code Summarization Guided by Control Flow Graph and Pseudo Code [79.87518649544405]
  We present a control flow graph and pseudo code guided binary code summarization framework called CP-BCS. CP-BCS utilizes a bidirectional instruction-level control flow graph and pseudo code that incorporates expert knowledge to learn the comprehensive binary function execution behavior and logic semantics.
  arXiv  Detail & Related papers  (2023-10-24T14:20:39Z)
• AI Chain on Large Language Model for Unsupervised Control Flow Graph Generation for Statically-Typed Partial Code [21.423928174875844]
  Control Flow Graphs (CFGs) are essential for visualizing, understanding and analyzing program behavior. We propose a novel approach that leverages the error-tolerant and understanding ability of pre-trained Large Language Models (LLMs) to generate CFGs.
  arXiv  Detail & Related papers  (2023-06-01T14:52:59Z)
• C-rusted: The Advantages of Rust, in C, without the Disadvantages [0.0]
  C-rusted is an innovative technology whereby C programs can be (partly) annotated so as to express: ownership, exclusivity and shareability of language, system and user-defined resources. The (partially) annotated C programs can be translated with unmodified versions of any compilation toolchain capable of processing ISO C code.
  arXiv  Detail & Related papers  (2023-02-10T15:48:09Z)
• Adaptive Context Selection for Polyp Segmentation [99.9959901908053]
  We propose an adaptive context selection based encoder-decoder framework which is composed of Local Context Attention (LCA) module, Global Context Module (GCM) and Adaptive Selection Module (ASM) LCA modules deliver local context features from encoder layers to decoder layers, enhancing the attention to the hard region which is determined by the prediction map of previous layer. GCM aims to further explore the global context features and send to the decoder layers. ASM is used for adaptive selection and aggregation of context features through channel-wise attention.
  arXiv  Detail & Related papers  (2023-01-12T04:06:44Z)
• Inductive Learning on Commonsense Knowledge Graph Completion [89.72388313527296]
  Commonsense knowledge graph (CKG) is a special type of knowledge graph (CKG) where entities are composed of free-form text. We propose to study the inductive learning setting for CKG completion where unseen entities may present at test time. InductivE significantly outperforms state-of-the-art baselines in both standard and inductive settings on ATOMIC and ConceptNet benchmarks.
  arXiv  Detail & Related papers  (2020-09-19T16:10:26Z)

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.