AI RESEARCH
Graph Construction and Matching for Imperative Programs using Neural and Structural Methods
arXiv CS.AI
•
ArXi:2604.26578v1 Announce Type: cross 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 their annotations into typed, attributed graphs. Our experiments cover datasets including C with ACSL, Java with JML, and Dafny for C\#. The pipeline integrates abstract syntax tree parsing with semantic embeddings derived from models such as SentenceTransformer and Code.