Graph Construction and Matching for Imperative Programs using Neural and Structural Methods
📰 ArXiv cs.AI
Learn to construct and match graphs for imperative programs using neural and structural methods to improve program verification and reuse
Action Steps
- Convert imperative programs into typed, attributed graphs using a pipeline approach
- Integrate abstract syntax trees and control flow graphs to create a comprehensive graph representation
- Apply neural and structural methods to match graphs and identify similarities across programs
- Use graph matching to reuse verification artefacts and improve program verification efficiency
- Evaluate the effectiveness of the graph construction and matching pipeline using datasets such as C with ACSL, Java with JML, and Dafny for C#
Who Needs to Know This
Software engineers and researchers working on program verification and reuse can benefit from this technique to improve the efficiency and accuracy of their workflows
Key Insight
💡 Graph construction and matching can be used to identify structural and semantic similarities across programs and their specifications, enabling the reuse of verification artefacts
Share This
🤖 Construct and match graphs for imperative programs to improve verification and reuse! 📈
Key Takeaways
Learn to construct and match graphs for imperative programs using neural and structural methods to improve program verification and reuse
Full Article
Title: Graph Construction and Matching for Imperative Programs using Neural and Structural Methods
Abstract:
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 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 sy
Abstract:
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 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 sy
DeepCamp AI