Constraints Meet Concurrency
This book describes the benefits that emerge when the fields of constraint programming and concurrency meet. On the one hand, constraints can be used in concurrency theory to increase the conciseness and the expressive power of concurrent languages from a
- PDF / 2,044,768 Bytes
- 151 Pages / 453.543 x 683.15 pts Page_size
- 47 Downloads / 189 Views
Jacopo Mauro
Constraints Meet Concurrency
Atlantis Studies in Computing Volume 5
Series editors Jan A. Bergstra, Amsterdam, The Netherlands Michael W. Mislove, New Orleans, USA
For further volumes: http://www.atlantis-press.com
Aims and Scope of the Series The series aims at publishing books in the areas of computer science, computer and network technology, IT management, information technology and informatics from the technological, managerial, theoretical/fundamental, social or historical perspective. We welcome books in the following categories: Technical monographs: these will be reviewed as to timeliness, usefulness, relevance, completeness and clarity of presentation. Textbooks. Books of a more speculative nature: these will be reviewed as to relevance and clarity of presentation. For more information on this series and our other book series, please visit our website at: www.atlantis-press.com/publications/books Atlantis Press 29, avenue Laumière 75019 Paris, France
Jacopo Mauro
Constraints Meet Concurrency
Jacopo Mauro University of Bologna Bologna Italy
ISSN 2212-8557 ISBN 978-94-6239-066-9 DOI 10.2991/978-94-6239-067-6
ISSN 2212-8565 (electronic) ISBN 978-94-6239-067-6 (eBook)
Library of Congress Control Number: 2014930346 Atlantis Press and the authors 2014 This book, or any parts thereof, may not be reproduced for commercial purposes in any form or by any means, electronic or mechanical, including photocopying, recording or any information storage and retrieval system known or to be invented, without prior permission from the Publisher. Printed on acid-free paper
I dedicate this to my family and friends; Nullius boni sine socio iucunda possessio est
Foreword
The Italian Chapter of the European Association for Theoretical Computer Science (EATCS) was founded in 1988, and aims at facilitating the exchange of ideas and results among Italian theoretical computer scientists, and at stimulating cooperation between the theoretical and the applied communities in Italy. One of the major activities of this Chapter is to promote research in theoretical computer science, stimulating scientific excellence by supporting and encouraging the very best and creative young Italian theoretical computer scientists. This is done also by sponsoring a prize for the best Ph.D. thesis. An interdisciplinary committee selects the best two Ph.D. theses, among those defended in the previous year, one on the themes of Algorithms, Automata, Complexity, and Game Theory, and the other one on the themes of Logics, Semantics, and Programming Theory. In 2012, we started a cooperation with Atlantis Press so that the selected Ph.D. theses will be published as volumes in the Atlantis Studies in Computing. The present volume contains one of the two theses selected for publication in 2013: Constraints Meet Concurrency by Jacopo Mauro (supervisor: Prof. Maurizio Gabbrielli, University of Bologna, Italy) and Secure Computation Under Network and Physical Attacks by Alessandra Scafuro (supervisor: Prof. Ivan Visconti, University
Data Loading...
