Evaluation diversity for graph conditions
DOI10.1016/J.JLAMP.2023.100862zbMATH Open1512.68132OpenAlexW4323353030MaRDI QIDQ6156934FDOQ6156934
Authors: Sven Schneider, Leen Lambers
Publication date: 19 June 2023
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2023.100862
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Logic in computer science (03B70)
Cites Work
- Correctness of high-level transformation systems relative to nested conditions
- Fundamentals of algebraic graph transformation
- \(\mathcal M\)-adhesive transformation systems with nested application conditions. II: Embedding, critical pairs and local confluence
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- On the Operationalization of Graph Queries with Generalized Discrimination Networks
- Title not available (Why is that?)
- Fundamental Approaches to Software Engineering
- Title not available (Why is that?)
- The unified modeling language
- Symbolic Model Generation for Graph Properties
- Evaluation diversity for graph conditions
- Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations
Cited In (1)
This page was built for publication: Evaluation diversity for graph conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6156934)