Industrial applications of formal methods to model, design and analyze computer systems: an international survey
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Property specification patterns for finite-state verification
FMSP '98 Proceedings of the second workshop on Formal methods in software practice
Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools
Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking
Verification of Automatically Generated Pattern-Based LTL Specifications
HASE '07 Proceedings of the 10th IEEE High Assurance Systems Engineering Symposium
Modeling and Verifying Graph Transformations in Proof Assistants
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal Verification of Graph Grammars using Mathematical Induction
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of graph grammars using a logical approach
Science of Computer Programming
Hi-index | 0.00 |
Essential characteristics of the behavior of a system may be described by properties. These descriptions must be precise and unambiguous to enable verification through (semi-)automated tools. There are many appropriate mathematical languages for writing system requirements, but they are often difficult to be applied by user without a good mathematical background. Patterns for property specifications capture recurring solutions for common problems, simplifying this task. This paper presents specification patterns for properties over reachable states of graph grammars, that is, properties of complex graph structures. This proposal may be used to aid the verification of systems where states are represented as graphs.