Paper: Verification of Concurrent Programs: The Automata-Theoretic Framework (at LICS 1987)

Authors: Moshe Y. Vardi

Abstract

We present an automata-theoretic framework to the verification of concurrent and nondeterministic programs. The basic idea is that to verify that a Program P is correct one writes a program A that receives the computation of P as input and diverges only on incorrect computations of P. Now P is correct if and only if the program P_A, which is obtained by combining P and A, terminates. This unifies previous works on verification on fair termination and verification of temporal properties.

BibTeX

  @InProceedings{Vardi-VerificationofConcu,
    author = 	 {Moshe Y. Vardi},
    title = 	 {Verification of Concurrent Programs: The Automata-Theoretic Framework},
    booktitle =  {Proceedings of the Second Annual IEEE Symposium on Logic in Computer Science (LICS 1987)},
    year =	 {1987},
    month =	 {June}, 
    pages =      {167--176},
    location =   {Ithaca, NY, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }