Paper Info
Title
Specification patterns for properties over reachable states of graph grammars
Abstract
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.
Year
DOI
Venue
2012
10.1007/978-3-642-33296-8_8
SBMF
Keywords
Field
DocType
specification pattern,property specification,good mathematical background,common problem,complex graph structure,reachable state,essential characteristic,graph grammar,automated tool,system requirement,appropriate mathematical language
Rule-based machine translation,Graph,Programming language,Computer science,Writing system,Theoretical computer science
Conference
Citations 
PageRank 
References 
5
0.54
11
Authors
3
Name
Order
Citations
PageRank
Simone Andre da Costa Cavalheiro1206.53
Luciana Foss29414.44
Leila Ribeiro329728.81