Foundations of Software Science and Computational Structures: 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $67.68
Usually ships in 1-2 business days
(Save 37%)
Other sellers (Paperback)
  • All (11) from $67.68   
  • New (9) from $67.68   
  • Used (2) from $108.99   


This book constitutes the refereed proceedings of the 10th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2007, held in Braga, Portugal in March/April 2007. The 25 revised full papers presented together with the abstract of one invited talk cover a broad spectrum on theories and methods to support analysis, synthesis, transformation and verification of programs and software systems.

Read More Show Less

Product Details

Table of Contents

Invited Talk.- Formal Foundations for Aspects.- Contributed Papers.- Sampled Universality of Timed Automata.- Iterator Types.- Types and Effects for Resource Usage Analysis.- The Complexity of Generalized Satisfiability for Linear Temporal Logic.- Formalising the—-Calculus Using Nominal Logic.- The Rewriting Calculus as a Combinatory Reduction System.- Relational Parametricity and Separation Logic.- Model-Checking One-Clock Priced Timed Automata.- Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems.- Optimal Strategy Synthesis in Shastic Müller Games.- Generalized Parity Games.- Tree Automata with Memory, Visibility and Structural Constraints.- Enriched—-Calculi Module Checking.- PDL with Intersection and Converse Is 2EXP-Complete.- Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems.- A Distribution Law for CCS and a New Congruence Result for the—-Calculus.- On the Expressiveness and Complexity of ATL.- Polynomial Constraints for Sets with Cardinality Bounds.- A Lower Bound on Web Services Composition.- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems.- Semantic Barbs and Biorthogonality.- On the Stability by Union of Reducibility Candidates.- An Effective Algorithm for the Membership Problem for Extended Regular Expressions.- Complexity Results on Balanced Context-Free Languages.- Logical Reasoning for Higher-Order Functions with Local State.

Read More Show Less

Customer Reviews

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

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & 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 & 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 & 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 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


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & 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 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)