Computer Aided Verification
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Computer Aided Verification: 3rd International Workshop, CAV '91, Aalborg, Denmark, July 1-4, 1991. Proceedings(575 Lecture Notes in Computer Science)
Computer Aided Verification: 3rd International Workshop, CAV '91, Aalborg, Denmark, July 1-4, 1991. Proceedings(575 Lecture Notes in Computer Science)

Computer Aided Verification: 3rd International Workshop, CAV '91, Aalborg, Denmark, July 1-4, 1991. Proceedings(575 Lecture Notes in Computer Science)

|
     0     
5
4
3
2
1




International Edition


About the Book

This volume contains the proceedings of the third International Workshop on Computer Aided Verification, CAV '91, held in Aalborg, Denmark, July 1-4, 1991. The objective of this series of workshops is to bring together researchers and practitioners interested in the development and use of methods, tools and theories for automatic verification of (finite) state systems. The workshop provides a unique opportunity for comparing the numerous verification methods and associated verification tools, and the extent to which they may be utilized in application design. The emphasis is not only on new research results but also on the application of existing results to real verification problems. The papers in the volume areorganized into sections on equivalence checking, model checking, applications, tools for process algebras, the state explosion problem, symbolic model checking, verification and transformation techniques, higher order logic, partial order approaches, hardware verification, timed specification and verification, and automata.

Table of Contents:
Taming infinite state spaces.- Silence is golden: Branching bisimilarity is decidable for context-free processes.- Computing distinguishing formulas for branching bisimulation.- Compositional checking of satisfaction.- An action based framework for verifying logical and behavioural properties of concurrent systems.- A linear-time model-checking algorithm for the alternation-free modal mu-calculus.- Automatic temporal verification of buffer systems.- Mechanically checked proofs of kernel specifications.- A top down approach to the formal specification of SCI cache coherence.- Integer programming in the analysis of concurrent systems.- The lotos model of a fault protected system and its verification using a petri net based approach.- Error diagnosis in finite communicating systems.- Temporal precondition verification of design transformations.- PAM: A process algebra manipulator.- The Concurrency Workbench with priorities.- A proof assistant for PSF.- Avoiding state explosion by composition of minimal covering graphs.- “On the fly” verification of behavioural equivalences and preorders.- Bounded-memory algorithms for verification on-the-fly.- Generating BDDs for symbolic model checking in CCS.- Vectorized symbolic model checking of computation tree logic for sequential machine verification.- Functional extension of symbolic model checking.- An automated proof technique for finite-state machine equivalence.- From data structure to process structure.- Checking for language inclusion using simulation preorders.- A semantic driven method to check the fineteness of CCS processes.- Using the HOL prove assistant for proving the correctness of term rewriting rules reducing terms of sequential behavior.- Mechanizing a proof by induction of process algebra specifications in higher order logic.- A two-level formal verification methodology using HOL and COSMOS.- Efficient algorithms for verification of equivalences for probabilistic processes.- Partial-order model checking: A guide for the perplexed.- Using partial orders for the efficient verification of deadlock freedom and safety properties.- Complexity results for POMSET languages.- Mechanically verifying safety and liveness properties of delay insensitive circuits.- Automating most parts of hardware proofs in HOL.- An overview and synthesis on timed process algebras.- Minimum and maximum delay problems in realtime systems.- Formal verification of speed-dependent asynchronous circuits using symbolic model checking of Branching Time Regular Temporal Logic.- Verifying properties of HMS machine specifications of real-time systems.- A linear time process algebra.- Deciding properties of regular real timed processes.- An algebra of Boolean processes.- Comparing generic state machines.- An automata theoretic approach to Temporal Logic.


Best Sellers


Product Details
  • ISBN-13: 9783540551799
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 233 mm
  • No of Pages: 493
  • Returnable: Y
  • Sub Title: 3rd International Workshop, CAV '91, Aalborg, Denmark, July 1-4, 1991. Proceedings
  • ISBN-10: 3540551794
  • Publisher Date: 22 Apr 1992
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Series Title: 575 Lecture Notes in Computer Science
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Computer Aided Verification: 3rd International Workshop, CAV '91, Aalborg, Denmark, July 1-4, 1991. Proceedings(575 Lecture Notes in Computer Science)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Computer Aided Verification: 3rd International Workshop, CAV '91, Aalborg, Denmark, July 1-4, 1991. Proceedings(575 Lecture Notes in Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Computer Aided Verification: 3rd International Workshop, CAV '91, Aalborg, Denmark, July 1-4, 1991. Proceedings(575 Lecture Notes in Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!