---
res:
  bibo_abstract:
  - 'Model-checking algorithms can be used to verify, formally and automatically,
    if a low-level description of a design conforms with a high-level description.
    However, for designs with very large state spaces, prior to the application of
    an algorithm, the refinement-checking task needs to be decomposed into subtasks
    of manageable complexity. It is natural to decompose the task following the component
    structure of the design. However, an individual component often does not satisfy
    its requirements unless the component is put into the right context, which constrains
    the inputs to the component. Thus, in order to verify each component individually,
    we need to make assumptions about its inputs, which are provided by the other
    components of the design. This reasoning is circular: component A is verified
    under the assumption that context B behaves correctly, and symmetrically, B is
    verified assuming the correctness of A. The assume-guarantee paradigm provides
    a systematic theory and methodology for ensuring the soundness of the circular
    style of postulating and discharging assumptions in component-based reasoning.We
    give a tutorial introduction to the assume-guarantee paradigm for decomposing
    refinement-checking tasks. To illustrate the method, we step in detail through
    the formal verification of a processor pipeline against an instruction set architecture.
    In this example, the verification of a three-stage pipeline is broken up into
    three subtasks, one for each stage of the pipeline.@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Thomas A
      foaf_name: Henzinger, Thomas A
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=40876CD8-F248-11E8-B48F-1D18A9856A87
    orcid: 0000−0002−2985−7724
  - foaf_Person:
      foaf_givenName: Shaz
      foaf_name: Qadeer, Shaz
      foaf_surname: Qadeer
  - foaf_Person:
      foaf_givenName: Sriram
      foaf_name: Rajamani, Sriram
      foaf_surname: Rajamani
  bibo_doi: 10.1109/ICCAD.2000.896481
  dct_date: 2000^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0780364457
  dct_language: eng
  dct_publisher: IEEE@
  dct_title: Decomposing refinement proofs using assume-guarantee reasoning@
...