Checking that finite state concurrent programs satisfy their linear specification

  • Authors:
  • Orna Lichtenstein;Amir Pnueli

  • Affiliations:
  • Tel Aviv University, Ramat Aviv, Tel Aviv, Israel 69978;The Weizmann Institute of Science, Rehovot, 76100 Israel

  • Venue:
  • POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
  • Year:
  • 1985

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an algorithm for checking satisfiability of a linear time temporal logic formula over a finite state concurrent program. The running time of the algorithm is exponential in the size of the formula but linear in the size of the checked program. The algorithm yields also a formal proof in case the formula is valid over the program. The algorithm has four versions that check satisfiability by unrestricted, impartial, just and fair computations of the given program.