Loading
Cover of CONCUR 2004 - Concurrency Theory: 15th International Conference, London, UK, August 31 - September 3, 2004. Proceedings

Book guide and evaluation

CONCUR 2004 - Concurrency Theory: 15th International Conference, London, UK, August 31 - September 3, 2004. Proceedings

Tony Andrews,Shaz Qadeer,Sriram K. Rajamani,Jakob Rehof,Yichen Xie (auth.),Philippa Gardner,Nobuko Yoshida (eds.)

English Unordered Computer Science and Theory
4.3 / 5

0 reviews

2004

Published

547

pages

498

views

This book constitutes the refereed proceedings of the 15th International Conference on Concurrency Theory, CONCUR 2004, held in London, UK in August/September 2004.The 29 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 134 su

Before you read

What will you get from this book?

This book constitutes the refereed proceedings of the 15th International Conference on Concurrency Theory, CONCUR 2004, held in London, UK in August/September 2004.The 29 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 134 submissions. Among the topics covered are concurrency related aspects of models of computation, semantic domains, process algebras, Petri nets, event structures, real-time systems, hybrid systems, decidability, model checking, verification techniques, refinement, term and graph rewriting, distributed programming, constraint logic programming, object-oriented programming, typing systems and algorithms, case studies, tools, and environments for programming and verification.

Ask this book

Your question is answered in the context of this title and author. Each answer uses 2 points.

Sign in to ask the book assistant.

Reader reviews

0 reviews, 4.3 average out of 5

No reviews yet

If you have read this book, help the next reader with your experience.

Write a review

Sign in to publish a review.

Reader questions and answers

Ask a focused question and learn from the community.

Sign in to ask or answer a question.

No questions yet

Be the first to ask a clear, useful question.