skip to content
Using mappings to prove timing properties Preview this item
ClosePreview this item
Checking...

Using mappings to prove timing properties

Author: Nancy A Lynch; Hagit Attiya; Massachusetts Institute of Technology. Laboratory for Computer Science.
Publisher: Cambridge, Mass. : Laboratory for Computer Science, Massachusetts Institute of Technology, 1991.
Series: MIT/LCS/TM, 412c.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Nancy A Lynch; Hagit Attiya; Massachusetts Institute of Technology. Laboratory for Computer Science.
OCLC Number: 23361402
Notes: "December 15, 1989."
Description: 39 p. ; 28 cm.
Series Title: MIT/LCS/TM, 412c.
Responsibility: Nancy A. Lynch and Hagit Attiya.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/23361402>
library:oclcnum"23361402"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/23361402>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
<http://viaf.org/viaf/154819218>
rdf:typeschema:Organization
schema:name"Massachusetts Institute of Technology. Laboratory for Computer Science."
schema:contributor
schema:creator
schema:datePublished"1991"
schema:exampleOfWork<http://worldcat.org/entity/work/id/22646849>
schema:inLanguage"en"
schema:name"Using mappings to prove timing properties"@en
schema:numberOfPages"39"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.