de
en
Schliessen
Detailsuche
Bibliotheken
Projekt
Impressum
Datenschutz
Schliessen
Publizieren
Besondere Sammlungen
Digitalisierungsservice
Hilfe
Impressum
Datenschutz
zum Inhalt
Detailsuche
Schnellsuche:
OK
Ergebnisliste
Titel
Titel
Inhalt
Inhalt
Seite
Seite
Im Werk suchen
Steenken, Dominik: Verification of infinite-state graph transformation systems via abstraction. 2015
Inhalt
Introduction
Problem Definition
Contributions
Thesis Outline
Basic Definitions for Verifying Graph Transformation Systems
Graphs
Graph Transformation Systems
Model Checking Graph Transformation Systems
Abstracting Graph Transformation Systems using Three-Valued Logic
Motivation
Logical Encoding of Graphs
Three-Valued Logic
Shapes and Embedding
Abstract Transformation and State Space Construction
Refinement Using Shape Constraints
SMT Encoding of Graph Embeddings and Traces
Motivation
Satisfiability Modulo Theories
Encoding of a Graph
Encoding of a Graph Embedded Into a Shape
Encoding of a Trace
Encoding of a Rule Application
Encoding of the Emptiness of a Shape
Lazy State Space Construction
The Principle of Lazy State Space Construction
Shape Transition Trees
Basic Construction Loop of an STT
Interpolation-guided Refinement Loop
Error Analysis and Conditions on Refinement
Automatic Abstraction Refinement via the Trace Encoding
Manual Abstraction Refinement Supported by Soundness Checks
Implementation: Shape Graph Analyzer
Description and Usage
Architecture
Application Examples
Possibilities for Extension
Conclusion
Related work
Future Work
Summary and Concluding Thoughts
Appendix Proofs
Appendix Code Listings
References
Die detaillierte Suchanfrage erfordert aktiviertes Javascript.