Newsletter   Secure Checkout   View Cart (0 items)  
Search:    Welcome Guest! Save up to 30-40% on most items with our awesome everyday discounts!

Verifying Concurrent Processes Using Temporal Logic (Lecture Notes in Computer Science) [Paperback]

Our Price $ 93.06  
Retail Value $ 99.00  
You Save $ 5.94  
Item Number 234248  
Buy New $93.06
Quantity:
Available on the Internet only.

Item description for Verifying Concurrent Processes Using Temporal Logic (Lecture Notes in Computer Science) by B. T. Hailpern...

Verifying Concurrent Processes Using Temporal Logic (Lecture Notes in Computer Science) by B. T. Hailpern

Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!

Item Specifications...


Pages   220
Est. Packaging Dimensions:   Length: 9.3" Width: 6.7" Height: 0.5"
Weight:   0.75 lbs.
Binding  Softcover
Release Date   Mar 31, 1982
Publisher   Springer
ISBN  3540112057  
ISBN13  9783540112051  


Availability  72 units.
Availability accurate as of May 29, 2017 12:22.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.


More About B. T. Hailpern


Register your artisan biography and upload your photo! Are You The Artisan or Author behind this product?
Improve our customers experience by registering for an Artisan Biography Center Homepage.



Product Categories

1Books > Subjects > Computers & Internet > Programming > General



Reviews - What do customers think about Verifying Concurrent Processes Using Temporal Logic (Lecture Notes in Computer Science)?

how to verify parallel code  Jun 11, 2008
Sadly, the experience of reading the book is severely marred by the low quality of the printing. The text does not appear crisply. Instead, it is fuzzy. Detracting from the underlying messages.

The topic itself may be of some interest to those working on parallel computing. With code customised for a given parallel architecture, a key question is how to verify it? Hailpern offers some ideas grounded in temporal logic. Not every architecture being used today might qualify. But the payoff is automated verification that is absolute in a mathematical sense. Perhaps worth your while spending some time investigating his ideas?
 

Write your own review about Verifying Concurrent Processes Using Temporal Logic (Lecture Notes in Computer Science)



Ask A Question or Provide Feedback regarding Verifying Concurrent Processes Using Temporal Logic (Lecture Notes in Computer Science)


Item Feedback and Product Questions
For immediate assistance call 888.395.0572 during the hours of 10am thru 8pm EST Monday thru Friday and a customer care representative will be happy to help you!

Help us continuously improve our service by reporting your feedback or questions below:

I have a question regarding this product
The information above is incorrect or conflicting
The page has misspellings or incorrect grammar
The page did not load correctly in my browser or created an error.

Email Address:
Anti Spam Question. To combat spammers we require that you answer a simple question.
What color is the sky?
Leave This Blank :
Do Not Change This Text :



Add This Product Widget To Your Website

Looking to add this information to your own website? Then use our Product Widget to allow you to display product information in a frame that is 120 pixels wide by 240 pixels high.

    Copy and paste the following HTML into your website and enjoy!



Order toll-free weekdays 10am thru 10pm EST by phone: 1-888-395-0572 (Lines are closed on holidays & weekends.)
Customer Service | My Account | Track My Orders | Return Policy | Request Free Catalog | Email Newsletter


Resources
Gift Certificates
RSS Feeds
Corporate
About Us
Contact Us
Policies
Terms Of Use
Privacy Policy