Using patterns and composite propositions to automate the generation of LTL specifications

  • Authors:
  • Salamah Salamah;Ann Q. Gates;Vladik Kreinovich;Steve Roach

  • Affiliations:
  • Dept. of Computer Science, University of Texas at El Paso, El Paso, TX;Dept. of Computer Science, University of Texas at El Paso, El Paso, TX;Dept. of Computer Science, University of Texas at El Paso, El Paso, TX;Dept. of Computer Science, University of Texas at El Paso, El Paso, TX

  • Venue:
  • ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Property classifications and patterns, i.e., high-level abstractions that describe common behavior, have been used to assist practitioners in generating formal specifications that can be used in formal verification techniques. The Specification Pattern System (SPS) provides descriptions of a collection of patterns. Each pattern is associated with a scope that defines the extent of program execution over which a property pattern is considered. Based on a selected pattern, SPS provides a specification for each type of scope in multiple formal languages including Linear Temporal Logic (LTL). The (Prospec) tool extends SPS by introducing the notion of Composite Propositions (CP), which are classifications for defining sequential and concurrent behavior to represent pattern and scope parameters. In this work, we provide definitions of patterns and scopes when defined using CP classes. In addition, we provide general (template) LTL formulas that can be used to generate LTL specifications for all combinations of pattern, scope, and CP classes.