PulseAugur
LIVE 08:27:22
research · [3 sources] ·
0
research

Researchers develop graph construction for imperative programs using neural methods

Researchers have developed a pipeline to convert imperative programs and their annotations into typed, attributed graphs. This process combines abstract syntax tree parsing with semantic embeddings from models like SentenceTransformer and CodeBERT. The goal is to identify structural and semantic similarities across programs for reusing verification artifacts. Experiments using C, Java, and Dafny demonstrate the ability to create consistent graph representations across different languages and annotation styles. AI

Summary written by gemini-2.5-flash-lite from 3 sources. How we write summaries →

IMPACT Enables more efficient reuse of software verification artifacts through improved program similarity detection.

RANK_REASON This is a research paper describing a new method for program analysis.

Read on arXiv cs.AI →

COVERAGE [3]

  1. arXiv cs.AI TIER_1 · Arshad Beg, Diarmuid O'Donoghue, Rosemary Monahan ·

    Graph Construction and Matching for Imperative Programs using Neural and Structural Methods

    arXiv:2604.26578v1 Announce Type: cross Abstract: Reusing verification artefacts requires identifying structural and semantic similarities across programs and their specifications. In this paper, we focus on graph construction as a foundational step toward this goal. We present a…

  2. arXiv cs.AI TIER_1 · Rosemary Monahan ·

    Graph Construction and Matching for Imperative Programs using Neural and Structural Methods

    Reusing verification artefacts requires identifying structural and semantic similarities across programs and their specifications. In this paper, we focus on graph construction as a foundational step toward this goal. We present a pipeline that converts imperative programs and th…

  3. Hugging Face Daily Papers TIER_1 ·

    Graph Construction and Matching for Imperative Programs using Neural and Structural Methods

    Reusing verification artefacts requires identifying structural and semantic similarities across programs and their specifications. In this paper, we focus on graph construction as a foundational step toward this goal. We present a pipeline that converts imperative programs and th…