Symbolic model generation for graph properties
DOI10.1007/978-3-662-54494-5_13zbMATH Open1430.68241OpenAlexW2603072184MaRDI QIDQ5215908FDOQ5215908
Authors: Sven Schneider, Leen Lambers, Fernando Orejas 
Publication date: 13 February 2020
Published in: Fundamental Approaches to Software Engineering (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/114397
Recommendations
- Finding models through graph saturation
- Tableau-based reasoning for graph properties
- A navigational logic for reasoning about graph properties
- Towards the automated generation of consistent, diverse, scalable and realistic graph models
- Efficient symbolic implementation of graph automata with applications to invariant checking
model generationgraph transformationgraph propertiessatisfiability solvingtableau methodnested graph conditions
Graph theory (including graph drawing) in computer science (68R10) Model theory of finite structures (03C13) Logic in computer science (03B70) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cited In (10)
- Tableau-based reasoning for graph properties
- A navigational logic for reasoning about graph properties
- Evaluation diversity for graph conditions
- Initial conflicts for transformation rules with nested application conditions
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
- Evaluation diversity for graph conditions
- Analysis of graph transformation systems: native vs translation-based techniques
- Finding models through graph saturation
- Towards the automated generation of consistent, diverse, scalable and realistic graph models
- Monadic second-order incorrectness logic for GP 2
Uses Software
This page was built for publication: Symbolic model generation for graph properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5215908)
