View in EDS

Temporal property verification as a program analysis task.

Saved in:
Bibliographic Details
Title: Temporal property verification as a program analysis task.
Authors: Cook, Byron1 bycook@microsoft.com, Koskinen, Eric2 ejk@cims.nyu.edu, Vardi, Moshe3 vardi@cs.rice.edu
Source: Formal Methods in System Design. Aug2012, Vol. 41 Issue 1, p66-82. 17p.
Subjects: Temporal databases, Computer software, Computer systems, Internet servers, Online databases, Client/server computing
Abstract: We describe a reduction from temporal property verification to a program analysis problem. First we present a proof system that, unlike the standard formulation, is more amenable to reasoning about infinite-state systems: disjunction is treated by partitioning, rather than enumerating, the state space and temporal operators are characterized with special sets of states called frontiers. We then describe a transformation that, with the use of procedures and nondeterminism, enables off-the-shelf program analysis tools to naturally perform the reasoning necessary for proving temporal properties ( e.g. backtracking, eventuality checking, tree counterexamples for branching-time properties, abstraction refinement, etc.). Using examples drawn from the PostgreSQL database server, Apache web server, and Windows OS kernel, we demonstrate the practical viability of our work. [ABSTRACT FROM AUTHOR]
Copyright of Formal Methods in System Design 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: 77383964
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Temporal property verification as a program analysis task.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Cook%2C+Byron%22">Cook, Byron</searchLink><relatesTo>1</relatesTo><i> bycook@microsoft.com</i><br /><searchLink fieldCode="AR" term="%22Koskinen%2C+Eric%22">Koskinen, Eric</searchLink><relatesTo>2</relatesTo><i> ejk@cims.nyu.edu</i><br /><searchLink fieldCode="AR" term="%22Vardi%2C+Moshe%22">Vardi, Moshe</searchLink><relatesTo>3</relatesTo><i> vardi@cs.rice.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Formal+Methods+in+System+Design%22">Formal Methods in System Design</searchLink>. Aug2012, Vol. 41 Issue 1, p66-82. 17p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Temporal+databases%22">Temporal databases</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+software%22">Computer software</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+systems%22">Computer systems</searchLink><br /><searchLink fieldCode="DE" term="%22Internet+servers%22">Internet servers</searchLink><br /><searchLink fieldCode="DE" term="%22Online+databases%22">Online databases</searchLink><br /><searchLink fieldCode="DE" term="%22Client%2Fserver+computing%22">Client/server computing</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We describe a reduction from temporal property verification to a program analysis problem. First we present a proof system that, unlike the standard formulation, is more amenable to reasoning about infinite-state systems: disjunction is treated by partitioning, rather than enumerating, the state space and temporal operators are characterized with special sets of states called frontiers. We then describe a transformation that, with the use of procedures and nondeterminism, enables off-the-shelf program analysis tools to naturally perform the reasoning necessary for proving temporal properties ( e.g. backtracking, eventuality checking, tree counterexamples for branching-time properties, abstraction refinement, etc.). Using examples drawn from the PostgreSQL database server, Apache web server, and Windows OS kernel, we demonstrate the practical viability of our work. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Formal Methods in System Design 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=77383964
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10703-012-0153-5
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 17
        StartPage: 66
    Subjects:
      – SubjectFull: Temporal databases
        Type: general
      – SubjectFull: Computer software
        Type: general
      – SubjectFull: Computer systems
        Type: general
      – SubjectFull: Internet servers
        Type: general
      – SubjectFull: Online databases
        Type: general
      – SubjectFull: Client/server computing
        Type: general
    Titles:
      – TitleFull: Temporal property verification as a program analysis task.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Cook, Byron
      – PersonEntity:
          Name:
            NameFull: Koskinen, Eric
      – PersonEntity:
          Name:
            NameFull: Vardi, Moshe
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 08
              Text: Aug2012
              Type: published
              Y: 2012
          Identifiers:
            – Type: issn-print
              Value: 09259856
          Numbering:
            – Type: volume
              Value: 41
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Formal Methods in System Design
              Type: main
ResultId 1