• DocumentCode
    750553
  • Title

    An Exercise in Automatic Program Verification

  • Author

    Polak, Wolfgang

  • Author_Institution
    Artificial Intelligence Laboratory, Stanford University
  • Issue
    5
  • fYear
    1979
  • Firstpage
    453
  • Lastpage
    458
  • Abstract
    This paper describes in some detail the computer-aided proof of a permutation program obtained using the Stanford Pascal verifier. We emphasize the systematic way in which a proof can be developed from an intuitive understanding of the program. The paper fillustrates the current state of the art in automatic program verification.
  • Keywords
    Assertion language; automatic program verification; inductive assertions; pennutation; theorem proving; Artificial intelligence; Lead; Assertion language; automatic program verification; inductive assertions; pennutation; theorem proving;
  • fLanguage
    English
  • Journal_Title
    Software Engineering, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-5589
  • Type

    jour

  • DOI
    10.1109/TSE.1979.230183
  • Filename
    1702654
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=750553