ArtistDesign NoE

76. Social Event

Simon Bliudze — 2011-05-24T12:49:07Z

A workshop dinner open to all ICE participants will be organised at about 8pm on Thursday, 10th of June (financial participation will be requested). The location will be announced shortly. We hope to see you there! - ICE 2011

90. Previous editions

Simon Bliudze — 2011-01-17T17:03:16Z

The previous three editions of ICE have been held in:
ICE'08: Synchronous and Asynchronous Interactions held in Reykjavik, Iceland, co-located with ICALP'08. The post-proceedings were published in ENTCS (vol.229-3).
ICE'09: Structured Interactions held in Bologna, Italy, co-located with CONCUR'09. The post-proceedings were published in EPTCS (vol.12) and a special issue of MSCS is in preparation.
ICE'10: Guaranteed Interactions held in Amsterdam, The Netherlands, co-located with DisCoTec'10. The post-proceedings were published in EPTCS (vol.38) and a joint special issue of SACS (with CAMPUS'10 and CS2BIO'10) is now in preparation.

80. Registration and venue

Simon Bliudze — 2011-01-17T16:59:24Z

Registration and Venue information is available on the main conference site.

70. Committees

Simon Bliudze — 2011-01-17T16:56:38Z

Programme Committee

Karthik Bhargavan – INRIA, France
Simon Bliudze – CEA LIST, France (co-chair)
Filippo Bonchi – CNRS, France
Roberto Bruni – University of Pisa, Italy
Marzia Buscemi – IMT Lucca Institute for Advanced Studies, Italy
Luis Caires – Universidade Nova de Lisboa, Protugal
Marco Carbone – IT University of Copenhagen, Denmark
Gabriel Ciobanu – IASI, Romania
Laurent Doyen – ENS Cachan, France
Davide Grohmann – Italy
Daniel Hirschkoff – ENS Lyon, France
Barbara Jobstmann – CNRS/Verimag, France
Ivan Lanese – University of Bologna, Italy
Alberto Lluch Lafuente – IMT Lucca, Italy
Hernan Melgratti – University of Buenos Aires, Argentina
Dejan Nickovic – IST, Austria
Sylvain Pradalier – INRIA Rocquencourt, France
Sophie Quinton – TU Braunschweig, Germany
Alexandra Silva – CWI, Netherlands (co-chair)
Pawel Sobocinski – University of Southampton, UK
Ana Sokolova – University of Salzburg, Austria
Paola Spoletini – University of Insubria, Italy
Emilio Tuosto – University of Leicester, UK
Frank D. Valencia – LIX, France
Nalini Vasudevan – Intel Labs Santa Clara, USA
Hugo Torres Vieira – New University of Lisbon, Portugal
Erik de Vink – Technische Universiteit Eindhoven, Netherlands

ICEcreamers (organising committee)

Simon Bliudze – CEA LIST (co-chair)
Roberto Bruni – University of Pisa
Marco Carbone – IT University of Copenhagen
Alexandra Silva – CWI (co-chair)

Contact: ice2011 at easychair.org

60. Important dates

Simon Bliudze — 2011-01-17T16:36:56Z

Paper submission is now closed

Abstract submission:	~~28 March 2011~~ 4 April 2011
Submission deadline:	~~4 April 2011~~ 11 April 2011
Reviews, rebuttal and PC discussion:	11 13 April – 7 May 2011
Notification to authors:	9 May 2011
Camera-ready version for pre-proceedings:	23 May 2011
Workshop:	9 June 2011
Camera-ready version for post-proceedings:	15 September 2011

50. Paper submission

Simon Bliudze — 2011-01-17T16:31:57Z

Submission Guidelines

Papers must report previously unpublished work and not be submitted to another conference/workshops with refereed proceedings. Programme Committee members, barring the co-chairs, may (and indeed are encouraged) to contribute. Accepted papers must be presented at the workshop by one of the authors.

Submissions must be made electronically in PDF format via EasyChair and should not exceed 15 pages with EPTCS style.

Selection procedure

The workshop proposes an innovative paper selection mechanism based on an interactive discussion amongst authors and PC members. As shown by the past edition of ICE, this considerably improves the quality of the papers, the reviews and the discussion during the workshop. We continue by detailing the selection procedure.

After the submission deadline expires, each PC member declares her/his conflicts and preferences on papers.
Organisers assign at least three anonymous reviewers to each paper.
Organisers publish each submitted paper on a Wiki and at the same time they creat a discussion forum associated to the paper such that
- PC members can participate to any forum (provided that (s)he is not in conflict with the associated paper) so to enhance discussions (and hence reviews).
- Authors have access only to forums associated to their own papers.
- Organisers can intervene in any forum.
- The access to the forum is initially restricted to the authors of the associated paper and to all non-conflicting PC members, and to all the organisers.
- PC members are allowed to post comments/questions which other participants admitted to the forum may reply to.
Organisers participate to all discussions and possibly solicit participation on controversial disputes.

At the end of the discussion, the PC selects papers by considering not only the comments of the referees, but the whole discussion.

This selection procedure requires some efforts of the organisers, the reviewers and the authors but have been rather rewarding. In fact, on the one hand, reviewers may rapidly clarify possible blur aspects of papers by interacting with authors for elucidations; on the other hand, authors may better understand and address the comments of the reviewers.

Discussion forum

At least one author of each submitted paper must register at the discussion forum by

Choosing a nickname and a password;
Registering by clicking on the Register button, then accepting the rules and providing the necessary information;
Notifying the organisers of their chosen nickname by sending an email to the address, which will be communicated to authors upon submission of their paper.

Proceedings

The ICE 2011 post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (EPTCS). Electronic pre-proceedings will be available for all participants.

40. CFP

Simon Bliudze — 2011-01-17T16:27:11Z

Download the CfP [pdf | txt | doc] and the ICE 2011 leaflet [pdf]

The general scope includes theoretical and applied aspects of interactions and the handshaking mechanisms used among actors of concurrent/distributed systems. The workshop intends to attract researchers interested in models, verification, tools and programming primitives for complex interactions.

The theme of ICE'11 is Reliable and Contract-based Interactions. Reliable interactions are, e.g., those providing suitable guarantees on the overall behaviour of interactive systems, enjoying suitable logical safety/liveness properties, adhering to certain QoS standards, offering certain levels of trust/security. Contract-based interactions are those where the interacting entities are committed to give certain guarantees whenever certain assumptions are met by their operating environment (including other autonomous entities and networking middleware). This way, contracts can be used to define faulty and malicious behaviours and to identify the responsible in case of contract violation or abuse.

Topics of interest include, but shall not be limited to:
logics and types for interactions
concurrent models and semantics
techniques and tools for specification, analysis, verification of reliable interaction
programming primitives for reliable interactions
languages, protocols and mechanisms for sound coordination
"by construction" guarantees for reliable interaction
expressiveness results
formal languages for contracts
formal analysis of contracts
contract negotiation, discovery and monitoring

Submission guidelines

75. Programme

Simon Bliudze — 2011-01-17T16:22:32Z

ICE 2011 programme

Slot	Duration	Talk
09:00 – 09:10	*(00:10)*	Opening
09:10 – 10:00	(00:50)	Epistemic Strategies and Games on Concurrent Processes. Prakash Panangaden (invited talk)
10:00 – 10:30	*(00:30)*	Coffee break
10:30 – 11:00	*(00:30)*	Innocent Strategies as Sheaves and Interactive Equivalences for CCS. Tom Hirschowitz and Damien Pous
11:00 – 11:30	*(00:30)*	Interaction and Observation, Categorically. Vincenzo Ciancia
11:30 – 11:40	*(00:10)*	Short coffee break
11:40 – 12:10	*(00:30)*	SOS for Graph Rewriting. Tobias Heindel and Andrei Dorman
12:10 – 12:40	*(00:30)*	Polymorphic Endpoint Types for Copyless Message Passing. Luca Padovani and Viviana Bono
12:40 – 14:00	*(01:20)*	Lunch
14:00 – 15:00	*(01:00)*	A Uniform Framework for Modeling Processes Behaviors and their Performances. Rocco de Nicola (Joint Invited Talk with PACO 2011)
15:00 – 15:30	*(00:30)*	On the Reaction Time of Some Synchronous Systems. Ilias Garnier, Christophe Aussagues, Vincent David and Guy Vidal-Naquet
15:30 – 16:00	*(00:30)*	Semantic Models of Connectors: A Study on Equivalence. Sung-Shik T. Q. Jongmans and Farhad Arbab
16:00 – 16:30	*(00:30)*	Coffee break
16:30 – 17:20	*(00:50)*	Formal Analysis of Quantum Systems using Process Calculus. Simon Gay (Invited Talk)
17:20 – 17:30	*(00:10)*	Short coffee break
17:30 – 18:00	*(00:30)*	Amending Contracts for Choreographies. Laura Bocchi, Julien Lange* and Emilio Tuosto*
18:00 – 18:30	*(00:30)*	Contracts in Distributed Systems. Massimo Bartoletti, Emilio Tuosto and Roberto Zunino
18:30 – 18:40	*(00:10)*	Closing
20:00		Social Event

Presentation names in the above table link to the slides used by the speakers (courtesy of the said speakers). Be aware that some of them are quite big, the complete package is approximately 49Mb.

Invited talks

Rocco De Nicola (University of Florence, Italy; joint invited talk with PACO 2011) "A Uniform Framework for Modeling Processes Behaviors and their Performances" Abstract: Labeled transition systems (LTS) are typically used as behavioral models of nondeterministic processes, with labeled transitions defining a one-step state-to-state reachability relation. This model is made more general by modifying the transition relation in such a way that it associates with any source state and transition label a reachability distribution, i.e., a function mapping each possible target state to a value of some domain that expresses the degree of one-step reachability of that target state from the source one. The resulting model, called ULTraS from Uniform Labeled Transition System, can then be specialized, by selecting suitable domains, to a number of widely used behavioral models representing fully nondeterministic, fully probabilistic and fully stochastic processes, but also processes combining nondeterminism and probability or nondeterminism and stochasticity.
We will show how ULTraS can be used to model stochastic process calculi when the reachability distribution does represent the rate of the exponential distribution characterizing the execution time of the performed action. By defining appropriate operators on reachability distributions, we will provide compositional operational semantics of representative fragments of the major stochastic calculi and shed light on their differences and similarities.
The uniform treatment of different operational models can be extended uniformly to model classical behavioral equivalences like bisimulation, trace, and testing. These equivalences will be defined over ULTraS parametrically with respect to some measure function that expresses the degree of multi-step reachability of a set of states. It will be then shown that the specializations of bisimulation, trace, and testing equivalences over ULTraS, obtained for the various types of process by selecting suitable measure functions, coincide with some of the well known behavioral equivalences defined in the literature, thus emphasizing the adequacy of ULTraS as a unifying behavioral model.
This is the outcome of joint work with M. Bernardo, D. Latella, M. Loreti, M. Massink.
Simon Gay (University of Glasgow, UK) "Formal Analysis of Quantum Systems using Process Calculus and Model-Checking" Abstract Quantum communication and cryptographic protocols are well on the way to becoming an important practical technology. Although a large amount of successful research has been done on proving their correctness, most of this work does not make use of familiar techniques from formal methods: formal logics for specification, formal modelling languages, separation of levels of abstraction, compositional analysis, and so on.
I will argue that these techniques will be necessary for the analysis of large-scale systems that combine quantum and classical components, and present the results of initial investigation using two techniques: behavioural equivalence in process calculus, and model-checking.
Prakash Panangaden (Oxford University, UK on sabbatical leave from McGill University, Canada) "Epistemic Strategies and Games on Concurrent Processes" Abstract: We develop a game semantics for process algebra with two interacting agents. The purpose of our semantics is to make manifest the role of knowledge and information flow in the interactions between agents and to control the information available to interacting agents. We define games and strategies on process algebras, so that two agents interacting according to their strategies determine the execution of the process, replacing the traditional scheduler. We show that different restrictions on strategies represent different amounts of information being available to a scheduler. We also show that a certain class of strategies corresponds to the syntactic schedulers of Chatzikokolakis and Palamidessi, which were developed to overcome problems with traditional schedulers modelling interaction. The restrictions on these strategies have an explicit epistemic flavour. This is joint work with Konstantinos Chatzikokolakis and Sophia Knight, both at INRIA Saclay.

21. Social Event

Simon Bliudze — 2010-06-01T20:23:11Z

A workshop dinner open to all ICE participants will be organised at about 8pm on Thursday, 10th of June (after the workshop). The location will be announced shortly, but we can already say that it will be rather nice. We hope to see you there! - ICE'10

33. Short papers

Simon Bliudze — 2010-05-03T09:04:52Z

After the selection of the regular papers, we decided to reserve some additional slots for presentation of recent work in progress or visionary innovative ideas and approaches.

Short papers must report previously unpublished work although it is allowed that some extended versions are simultaneously submitted to other conferences / workshops with proceedings.

Accepted short papers will be considered for inclusion in the ICE'10 post-proceedings either in form of extended abstracts or as full papers.

ICE'10 post-proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://eptcs.org/).

Submissions of short papers must be made electronically in PDF format via EasyChair (http://www.easychair.org/conference...) and should not exceed 4 pages with EPTCS style (http://style.eptcs.org/).

Accepted short papers must be presented at the workshop by one of the authors.