Symbolic Model Generation for Graph Properties

DOI10.1007/978-3-662-54494-5_13zbMath1430.68241OpenAlexW2603072184MaRDI QIDQ5215908

Sven Schneider, Fernando Orejas, Leen Lambers

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

zbMATH Keywords

graph propertiestableau methodmodel generationgraph transformationsatisfiability solvingnested graph conditions

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Logic in computer science (03B70) Model theory of finite structures (03C13) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (7)

Initial Conflicts for Transformation Rules with Nested Application Conditions ⋮ Unnamed Item ⋮ A navigational logic for reasoning about graph properties ⋮ Evaluation diversity for graph conditions ⋮ Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality ⋮ Monadic second-order incorrectness logic for GP 2 ⋮ Evaluation diversity for graph conditions

Uses Software

• Clafer

This page was built for publication: Symbolic Model Generation for Graph Properties