View in EDS

A Mechanical Analysis of Program Verification Strategies.

Saved in:
Bibliographic Details
Title: A Mechanical Analysis of Program Verification Strategies.
Authors: Sandip Ray1, Warren Hunt1, John Matthews2, J. Moore1
Source: Journal of Automated Reasoning. May2008, Vol. 40 Issue 4, p245-269. 25p.
Subjects: Completeness theorem, Model theory, Comparative linguistics, Information theory
Abstract: Abstract  We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are (i) stepwise invariants, (ii) clock functions, and (iii) inductive assertions. We show how to formalize the strategies in the logic of the ACL2 theorem prover. Based on our formalization, we prove that each strategy is both sound and complete. The completeness result implies that given any proof of correctness of a sequential program one can derive a proof in each of the above strategies. The soundness and completeness theorems have been mechanically checked with ACL2. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Automated Reasoning is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 32805793
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A Mechanical Analysis of Program Verification Strategies.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Sandip+Ray%22">Sandip Ray</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Warren+Hunt%22">Warren Hunt</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22John+Matthews%22">John Matthews</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22J%2E+Moore%22">J. Moore</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Automated+Reasoning%22">Journal of Automated Reasoning</searchLink>. May2008, Vol. 40 Issue 4, p245-269. 25p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Completeness+theorem%22">Completeness theorem</searchLink><br /><searchLink fieldCode="DE" term="%22Model+theory%22">Model theory</searchLink><br /><searchLink fieldCode="DE" term="%22Comparative+linguistics%22">Comparative linguistics</searchLink><br /><searchLink fieldCode="DE" term="%22Information+theory%22">Information theory</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Abstract  We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are (i) stepwise invariants, (ii) clock functions, and (iii) inductive assertions. We show how to formalize the strategies in the logic of the ACL2 theorem prover. Based on our formalization, we prove that each strategy is both sound and complete. The completeness result implies that given any proof of correctness of a sequential program one can derive a proof in each of the above strategies. The soundness and completeness theorems have been mechanically checked with ACL2. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Automated Reasoning is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=32805793
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10817-008-9098-1
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 25
        StartPage: 245
    Subjects:
      – SubjectFull: Completeness theorem
        Type: general
      – SubjectFull: Model theory
        Type: general
      – SubjectFull: Comparative linguistics
        Type: general
      – SubjectFull: Information theory
        Type: general
    Titles:
      – TitleFull: A Mechanical Analysis of Program Verification Strategies.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Sandip Ray
      – PersonEntity:
          Name:
            NameFull: Warren Hunt
      – PersonEntity:
          Name:
            NameFull: John Matthews
      – PersonEntity:
          Name:
            NameFull: J. Moore
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 19
              M: 05
              Text: May2008
              Type: published
              Y: 2008
          Identifiers:
            – Type: issn-print
              Value: 01687433
          Numbering:
            – Type: volume
              Value: 40
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Journal of Automated Reasoning
              Type: main
ResultId 1