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.