Specification patterns for properties over reachable states of graph grammars

  • Authors:
  • Simone André da Costa Cavalheiro;Luciana Foss;Leila Ribeiro

  • Affiliations:
  • Centro de Desenvolvimento Tecnológico, Universidade Federal de Pelotas, Pelotas, RS, Brazil;Centro de Desenvolvimento Tecnológico, Universidade Federal de Pelotas, Pelotas, RS, Brazil;Instituto de Informática, Universidade Federal do Rio Grande do Sul, Porto Alegre, RS, Brazil

  • Venue:
  • SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.