Relations and Kleene Algebra in Computer Science: 9th International Conference on Relational Methods in Computer Science and 4th International Workshop on Applications of Kleene Algebra, RelMiCS/AKA 2006, Manchester, UK, August 29 - September2, 2006, Proc / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$99.46
Used and New from Other Sellers
Used and New from Other Sellers
from $25.40
Usually ships in 1-2 business days
(Save 78%)
Other sellers (Paperback)
  • All (7) from $25.40   
  • New (3) from $87.62   
  • Used (4) from $25.40   

Overview

The book constitutes the joint refereed proceedings of the 9th International Conference on Relational Methods in Computer Science, RelMiCS 2006, and the 4th International Workshop on Applications of Kleene Algebras, AKA 2006, held in Manchester, UK in August/September 2006. The 25 revised full papers presented together with two invited papers and the abstract of an invited talk were carefully reviewed and selected from 44 submissions.

Read More Show Less

Product Details

Table of Contents

Weak Kleene Algebra and Computation Trees.- Finite Symmetric Integral Relation Algebras with No 3-Cycles.- Computations and Relational Bundles.- An Axiomatization of Arrays for Kleene Algebra with Tests.- Local Variable Scoping and Kleene Algebra with Tests.- Computing and Visualizing Lattices of Subgroups Using Relation Algebra and RelView.- On the Complexity of the Equational Theory of Relational Action Algebras.- Demonic Algebra with Domain.- Topological Representation of Contact Lattices.- Betweenness and Comparability Obtained from Binary Relations.- Relational Representation Theorems for General Lattices with Negations.- Monotonicity Analysis Can Speed Up Verification.- Max-Plus Convex Geometry.- Lazy Semiring Neighbours and Some Applications.- Omega Algebra, Demonic Refinement Algebra and Commands.- Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell.- On the Cardinality of Relations.- Evaluating Sets of Search Points Using Relational Algebra.- Algebraization of Hybrid Logic with Binders.- Using Probabilistic Kleene Algebra for Prool Verification.- Monotone Predicate Transformers as Up-Closed Multirelations.- Homomorphism and Isomorphism Theorems Generalized from a Relational Perspective.- Relational Measures and Integration.- A Relational View of Recurrence and Attractors in State Transition Dynamics.- On Two Dually Nondeterministic Refinement Algebras.- On the Fixpoint Theory of Equality and Its Applications.- Monodic Tree Kleene Algebra.- Weak Relational Products.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)