[TYPES/announce] ICALP 2008: Call for Participation

[Luca Aceto]

[ The Types Forum (announcements only), 
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]



___

CALL FOR PARTICIPATION - ICALP'08

   35th International Colloquium on
  Automata,  Languages and Programming

   July 6-13, 2008, Reykjavik, Iceland

   http://www.ru.is/icalp08

___

The 35th International Colloquium on Automata, Languages and Programming, the 
main conference and annual meeting of the European Association for Theoretical 
Computer Science (EATCS) will be held from the 6th to the 13th of July 2008 on 
the premises of Reykjavik University in Reykjavik, Iceland. The main conference 
will take place from the 7th till the 11th of July, and will be preceded and 
followed by 13 co-located events. (See http://www.ru.is/icalp08/workshops.html 
for the list of events affiliated with ICALP 2008.) In addition, the ETACS 
award 2008 to Leslie G. Valiant (Harvard, USA) and the Goedel prize 2008 will 
be awarded at the conference.

Following the successful experience of the last three editions, ICALP 2008 will 
complement the established structure of the scientific program based on Track A 
on Algorithms, Automata, Complexity and Games, and Track B on Logic, Semantics, 
and Theory of Programming, corresponding to the two main streams of the journal 
Theoretical Computer Science, with a special Track C on Security and 
Cryptography Foundations The aim of Track C is to allow a deeper coverage of a 
particular topic, to be specifically selected for each year's edition of ICALP 
on the basis of its timeliness and relevance for the theoretical computer 
science community.

The scientific programme for the conference is available at the following URLs:

http://www.ru.is/icalp08/programme.html (programme overview)
http://www.ru.is/icalp08/Icalp08TrackAProg.html (track A)
http://www.ru.is/icalp08/programmeB.html (track B)
http://www.ru.is/icalp08/programmeC.html (track C).

Apart from the presentation of 126 selected contributions for the three tracks, 
the conference will feature the following invited talks:

   * Ran Canetti (IBM T.J. Watson Research Center and MIT, USA)
"Composable Formal Security Analysis: Juggling Soundness, Simplicity and 
Efficiency"
   * Bruno Courcelle (Labri, Universite Bordeaux, France)
"Graph Structure and Monadic Second-order Logic: Language Theoretical 
Aspects"
   * Javier Esparza (Technische Universitaet Muenchen, Germany)
 "Newtonian Program Analysis"
   * Muthu Muthukrishnan (Google, USA)
 "Internet Ad Auctions: Insights and Directions"
   * Peter Winkler (Dartmouth, USA).

In addition, Peter Winkler will hold a master class on mathematical puzzles on 
Tuesday, 8 July, and there will be talks by Leslie G. Valiant and the 
recipient(s) of the Goedel
prize 2008 on Thursday, 10 July.

REGISTRATION


Information on registration for the conference and affiliated events is 
available at

http://www.ru.is/icalp08/registration.html

To register, visit the URL

http://skraning.iii.is/icalpreg.asp

We strongly recommend that you register for the ICALP conference and book 
accommodation before May 5th, as that date is the deadline for registering at 
the lower fee. After May 5th hotel rooms will also start to get released since 
July is the prime holiday season in Iceland and the demand for hotel 
accommodation is very high.

NOTE: For those who have not decided yet which workshop(s) they are going to 
attend when registering for the conference, it is possible to register for 
workshops at the lower fee until June 5th by sending an e-mail to the 
Conference Secretariat at the address icalp2008 AT iii.is.


ORGANIZING COMMITTEE:
*

Luca Aceto
Magnus M. Halldorsson
Anna Ingolfsdottir

CONTACT ADDRESSES:
**

Email: icalp08 AT ru.is
For further information see: http://www.ru.is/icalp08/


**



Vinsamlega athugi? a? uppl?singar ? t?lvup?sti ?essum og vi?hengi eru eing?ngu 
aetla?ar ?eim sem p?stinum er beint til og gaetu innihaldi? uppl?singar sem eru 
tr?na?arm?l. Sj? n?nar: http://www.ru.is/trunadur

Please note that this e-mail and attachments are intended for the named 
addresses only and may contain information that is confidential and privileged. 
Further information:
http://www.ru.is/trunadur

[TYPES/announce] GPCE'08: Final Call for Papers

[Emir Pasalic]

[ The Types Forum (announcements only), 
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]


Call for Papers

   Seventh International Conference on
  Generative Programming and Component Engineering (GPCE 2008)

   October 19-23, 2008
   Nashville, Tennessee
  (co-located with OOPSLA 2008)
http://www.gpce.org


Important Dates:

  * Submission of abstracts:May 12, 2008
  * Notification:   June 30, 2008
  * Submission:  May 19, 2008, 23:59 Apia time

Scope

Generative and component approaches are revolutionizing software
development similar to how automation and components revolutionized
manufacturing. Generative Programming (developing programs that
synthesize other programs), Component Engineering (raising the level
of modularization and analysis in application design), and
Domain-Specific Languages (DSLs) (elevating program specifications to
compact domain-specific notations that are easier to write, maintain,
and analyze) are key technologies for automating program development.

The International Conference on Generative Programming and Component
Engineering provides a venue for researchers and practitioners
interested in techniques for enhancing the productivity, quality, and
time-to-market in software development that stems from deploying
components and automating program generation. In addition to exploring
cutting-edge techniques for developing generative and component-based
software, our goal is to foster further cross-fertilization between
the software engineering research community and the programming
languages community.

Submissions

Research papers:

10 pages in SIGPLAN proceedings style (sigplanconf.cls) reporting
original research results that contribute to scientific knowledge in
the areas listed below (the PC chair can advise on appropriateness).

Experience reports:

2 to 4 pages in length in SIGPLAN proceedings style
(sigplanconf.cls). We encourage experience reports that provide
concrete evidence with regards to the efficacy of generative
technologies in industrial applications.

Topics

GPCE seeks contributions in software engineering and in programming
languages related (but not limited) to:

  * Generative programming
o Reuse, meta-programming, partial evaluation, multi-stage and
  multi-level languages, step-wise refinement,
  and generic programming
o Semantics, type systems, symbolic computation, linking and
  explicit substitution, in-lining and macros, templates, and
  program transformation
o Runtime code generation, compilation, active libraries,
  synthesis from specifications, development methods,  
generation of

  non-code artifacts, formal methods, and reflection
  * Generative techniques for
o Product-line architectures
o Distributed, real-time and embedded systems
o Model-driven development and architecture
o Resource bounded/safety critical systems.
  * Component-based software engineering
o Reuse, distributed platforms and middleware, distributed
  systems, evolution, patterns, development methods,  
deployment and

  configuration techniques, and formal methods
  * Integration of generative and component-based approaches
  * Domain engineering and domain analysis
o Domain-specific languages including visual and UML-based DSLs
  * Separation of concerns
o Aspect-oriented and feature-oriented programming,
o Intentional programming and multi-dimensional separation of
  concerns
  * Industrial applications of the above

Experience reports on applications of these techniques to real-world
problems are especially encouraged, as are research papers that relate
ideas and concepts from several of these topics, or bridge the gap
between theory and practice. The program chair is happy to advise on
the appropriateness of a particular subject.

Submissions must adhere to SIGPLAN's republication policy. Please  
contact
the program chair if you have any questions about how this policy  
applies

to your paper (gpce2008 at gpce.org).

Organizers

General Chair: Yannis Smaragdakis (University of Oregon)
Program Chair: Jeremy Siek (University of Colorado at Boulder)
Satellite Chair: Ralf Lammel (Univ. Koblenz-Landau)
Publicity Chair: Emir Pasalic (LogicBlox, Inc.)

Program Committee

David Abrahams (Boost Consulting)
Uwe Assmann (Technische Universitat, Dresden)
Ira Baxter (Semantic Designs, USA)
Martin Bravenboer (Delft Univ. of Tech., The Netherlands)
Jacques Carette (McMaster University, Canada)
Shigeru Chiba (Tokyo Institute of Technology, Japan)
William R. Cook (University of Texas at Austin, USA)
Lidia Fuentes (University of Malaga, Spain)
Yossi Gil (The Technion, Israel)
Aniruddha Gokhale (Vanderbilt University, USA)
Mark Grechanik (Accenture Technology Labs, USA)
Stanislaw Ja

[TYPES/announce] Graph-Based Tools Contest: Call for Cases

[Arend Rensink]

[ The Types Forum (announcements only), 
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

Graph-Based Tools Contest: Call for Cases
=
12-13 September, Leicester, UK
Satellite workshop of ICGT 2008
http://www.fots.ua.ac.be/events/grabats2008/

Tools are crucial for the promotion of graph transformation in industry. 
Currently, a variety of tool environments exist for different graph 
transformation approaches. However, for potential users, working in application 
domains where graph transformation may be a useful technique, it is difficult 
to select the right tool for their purpose. Moreover, even the experience of 
many existing users does not extend beyond a few of the available tools. 
Finally, and maybe most importantly, the tool developers themselves can also be 
inspired by a more detailed understanding of related approaches.

The aim of this event is to compare the expressiveness, the usability and the 
performance of graph transformation tools along a number of selected case 
studies. This will enable us to learn about the pros and cons of each tool
considering different applications. A deeper understanding of the relative 
merits of different tool features will help to further improve graph 
transformation tools and to indicate open problems.

The event is the second of its kind: the first graph-based tool contest took 
place as part of the AGTIVE 2007 workshop in Kassel, Germany.


Phase 1: Case proposal submission
-

In order to facilitate the comparison of graph transformation tools, we are 
solliciting potential case studies. Submissions for case study proposals are 
requested. If you have a suitable case study, please describe it shortly but as 
detailed as needed and send it to Pieter Van Gorp ([EMAIL PROTECTED]) and to 
Arend Rensink ([EMAIL PROTECTED]) by *May 20, 2008* This includes cases that 
have already been carried out using a given tool. A committee will select a 
small, but representative set of case studies to be used for the contest.

Please submit at http://www.easychair.org/conferences/?conf=grabats2008


Phase 2: Case solution submission
-

All those who like to participate in the contest are asked to choose one or 
more case studies, take their favourite graph transformation tool and submit 
their solutions. Each submission should cover the following issues: a short 
presentation of the chosen graph transformation tool, a description of the 
chosen case study variant if any, a presentation of the chosen solution, 
including a discussion of design decisions. More detailed instructions will be 
given in the case descriptions themselves.

Solutions are to be submitted by July 1, 2008. Depending on the number of 
submissions, a selection will be made of solutions to be presented; the other 
submissions will get a chance for a (non-plenary) tool demo at the end of the 
workshop. In addition, it is planned to have a special journal issue where 
submitters have a chance to improve and write up their solutions.

Please submit at http://www.easychair.org/conferences/?conf=grabats2008


Phase 3: Workshop and live contest
--

Besides the presentation and discussion of the solutions, the workshop will 
include for the first time a live contest session. During this session, which 
will take place the afternoon of Friday, September 12, participants will be 
handed out a case description which they will be asked to solve within the time 
available on Friday. Solutions will be compared and presented on Saturday, 
September 13, together with the submitted solutions to the published case 
studies. In this way we want to compare the usability of the tools for rapid 
development.


Important dates:

May 20, 2008:   Deadline for case study proposals
June 1, 2008:   Selected case studies published
July 1, 2008:   Deadline for solutions
August 1, 2008: Acceptance notice for solutions


Case Committee:
---
Rubino Geiss (University of Karlsruhe, Germany)
Gabor Karsai (Vanderbilt University, US)
Arend Rensink (University of Twente, The Netherlands)
Gabriele Taentzer (University of Marburg, Germany)
Pieter Van Gorp (University of Antwerp, Belgium)
Daniel Varro (Technical University of Budapest, Hungary)
Albert Zündorf (University of Kassel, Germany)


Organizers:
---
Arend Rensink (Email: [EMAIL PROTECTED])
Pieter Van Gorp (Email: [EMAIL PROTECTED])


Support:

Tom Staijen (Email: [EMAIL PROTECTED])

[TYPES/announce] Paper on Types for Conversations

[Hugo Torres Vieira]

[ The Types Forum (announcements only), 
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

Dear all,

We would like to announce the availability of the technical report
version of our paper on conversation types,

"Typing Conversations in the Conversation Calculus"
Luis Caires and Hugo Torres Vieira

We present a type system for the Conversation Calculus, a model
of service-oriented computation. Our types discipline the behavioral
structure of interactions that take place in conversations, while
accounting for dynamical join and leave of a possibly unanticipated
number of participants. Typed conversations are related to the notion
of session types, but generalize them in new dimensions particularly
adequate for modeling loosely-coupled service-oriented collaborations
among several parties.  The general notion of conversation type is not
specific to the conversation calculus, we believe it may be adapted to
simpler models such as the pi-calculus.  Our main technical result is
that a well-typed service system is certified to never violate the
prescribed conversation constraints (referred as choreographies and
contracts in web-services jargon) neither incur in certain kinds of
runtime errors, such as service unavailability.

URL:
http://www-ctp.di.fct.unl.pt/~htv/pub/typingconversationstr.pdf

Best regards,
Hugo and Luís