<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>You assume, we guarantee: Methodology and case studies</title></titleInfo>

  
  
<titleInfo type="alternative">
  
  <title>LNCS</title>
</titleInfo>

<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Thomas A</namePart>
  <namePart type="family">Henzinger</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">40876CD8-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000−0002−2985−7724</description></name>
<name type="personal">
  <namePart type="given">Shaz</namePart>
  <namePart type="family">Qadeer</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Sriram</namePart>
  <namePart type="family">Rajamani</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>









<name type="conference">
  <namePart>CAV: Computer Aided Verification</namePart>
</name>






<abstract lang="eng">Assume-guarantee reasoning has long been advertised as an important method for decomposing proof obligations in system verification. Refinement mappings (homomorphisms) have long been advertised as an important method for solving the language-inclusion problem in practice. When confronted with large verification problems, we therefore attempted to make use of both techniques. We soon found that rather than offering instant solutions, the success of assume-guarantee reasoning depends critically on the construction of suitable abstraction modules, and the success of refinement checking depends critically on the construction of suitable witness modules. Moreover, as abstractions need to be witnessed, and witnesses abstracted, the process must be iterated. We present here the main lessons we learned from our experiments, in limn of a systematic and structured discipline for the compositional verification of reactive modules. An infrastructure to support this discipline, and automate parts of the verification, has been implemented in the tool Mocha.</abstract>

<originInfo><publisher>Springer</publisher><dateIssued encoding="w3cdtf">1998</dateIssued><place><placeTerm type="text">Vancouver, Canada</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Proceedings of the 10th International Conference on Computer Aided Verification</title></titleInfo>
  <identifier type="isbn">9783540646082</identifier><identifier type="doi">10.1007/BFb0028765</identifier>
<part><detail type="volume"><number>1427</number></detail><extent unit="pages">440 - 451</extent>
</part>
</relatedItem>

<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<ista>Henzinger TA, Qadeer S, Rajamani S. 1998. You assume, we guarantee: Methodology and case studies. Proceedings of the 10th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 1427, 440–451.</ista>
<chicago>Henzinger, Thomas A, Shaz Qadeer, and Sriram Rajamani. “You Assume, We Guarantee: Methodology and Case Studies.” In &lt;i&gt;Proceedings of the 10th International Conference on Computer Aided Verification&lt;/i&gt;, 1427:440–51. Springer, 1998. &lt;a href=&quot;https://doi.org/10.1007/BFb0028765&quot;&gt;https://doi.org/10.1007/BFb0028765&lt;/a&gt;.</chicago>
<ama>Henzinger TA, Qadeer S, Rajamani S. You assume, we guarantee: Methodology and case studies. In: &lt;i&gt;Proceedings of the 10th International Conference on Computer Aided Verification&lt;/i&gt;. Vol 1427. Springer; 1998:440-451. doi:&lt;a href=&quot;https://doi.org/10.1007/BFb0028765&quot;&gt;10.1007/BFb0028765&lt;/a&gt;</ama>
<ieee>T. A. Henzinger, S. Qadeer, and S. Rajamani, “You assume, we guarantee: Methodology and case studies,” in &lt;i&gt;Proceedings of the 10th International Conference on Computer Aided Verification&lt;/i&gt;, Vancouver, Canada, 1998, vol. 1427, pp. 440–451.</ieee>
<apa>Henzinger, T. A., Qadeer, S., &amp;#38; Rajamani, S. (1998). You assume, we guarantee: Methodology and case studies. In &lt;i&gt;Proceedings of the 10th International Conference on Computer Aided Verification&lt;/i&gt; (Vol. 1427, pp. 440–451). Vancouver, Canada: Springer. &lt;a href=&quot;https://doi.org/10.1007/BFb0028765&quot;&gt;https://doi.org/10.1007/BFb0028765&lt;/a&gt;</apa>
<mla>Henzinger, Thomas A., et al. “You Assume, We Guarantee: Methodology and Case Studies.” &lt;i&gt;Proceedings of the 10th International Conference on Computer Aided Verification&lt;/i&gt;, vol. 1427, Springer, 1998, pp. 440–51, doi:&lt;a href=&quot;https://doi.org/10.1007/BFb0028765&quot;&gt;10.1007/BFb0028765&lt;/a&gt;.</mla>
<short>T.A. Henzinger, S. Qadeer, S. Rajamani, in:, Proceedings of the 10th International Conference on Computer Aided Verification, Springer, 1998, pp. 440–451.</short>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>4488</recordIdentifier><recordCreationDate encoding="w3cdtf">2018-12-11T12:09:06Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2022-09-05T07:31:52Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
