[TYPES/announce] EXPRESS/SOS 2014: Call for papers
Silvia Crafa
crafa at math.unipd.it
Wed May 21 03:47:54 EDT 2014
Combined 21th International Workshop on Expressiveness in Concurrency
and 11th Workshop on Structural Operational Semantics (EXPRESS/SOS 2014)
EXPRESS/SOS 2014
------------------------------------------------------------
September 1, 2014, Roma (Italy)
Affiliated with CONCUR 2014
http://www.math.unipd.it/~crafa/EXPRESSSOS2014/
Submission of abstracts: Wednesday June 11, 2014
Submission of papers: Sunday June 15, 2014
------------------------------------------------------
SCOPE AND TOPICS:
The EXPRESS workshop series aims at bringing together researchers
interested in the expressiveness of various formal systems and
semantic notions, particularly in the field of concurrency. The SOS
workshop series aims at being a forum for researchers, students and
practitioners interested in new developments, and directions for
future investigation, in the field of structural operational
semantics.
Since 2012, the EXPRESS and SOS communities have joined forces and
organised a combined EXPRESS/SOS workshop on the
semantics of systems and programming concepts, and on the
expressiveness of mathematical models of computation.
Topics of interest for this combined workshop include (but are not
limited to):
- expressiveness and comparison of models of computation (process
algebras, event structures, Petri nets, rewrite systems), and
programming models (distributed, component-based, object-oriented,
and service-oriented computing);
- logics for concurrency (modal logics, probabilistic and stochastic
logics, temporal logics and resource logics);
- analysis techniques for concurrent systems;
- theory of structural operational semantics (metatheory,
category-theoretic approaches, congruence results);
- comparison of structural operational semantics to other forms of
semantics;
- applications of structural operational semantics;
- software tools that automate, or are based on, structural
operational semantics.
SUBMISSION GUIDELINES:
We solicit two types of submissions:
* Full papers (up to 15 pages).
* Short papers (up to 5 pages, not included in the workshop proceedings)
Simultaneous submission to journals, conferences or other workshops is
only allowed for short papers; full papers must be unpublished.
There is one exception to this policy: authors may submit a full paper
that is still under review for TGC 2014, provided that they inform the
chairs prior to submission and immediately withdraw their submission
if it is accepted for TGC 2014.
All submissions should adhere to the EPTCS format (http://www.eptcs.org),
and submission is performed through the EXPRESS/SOS 2014 EasyChair
server (https://www.easychair.org/conferences/?conf=expresssos2014).
The final versions of accepted full papers will be published in EPTCS.
Furthermore, authors of a selection of the accepted papers will be
invited to submit an extended version to a special issue of a
high-quality journal.
INVITED SPEAKER:
TBA
IMPORTANT DATES:
Abstract submission: June 11, 2014
Paper submission: June 15, 2014
Notification date: July 13, 2014
Camera ready version: July 23, 2014
WORKSHOP CO-CHAIRS:
Johannes Borgström (Uppsala University, Sweden)
Silvia Crafa (University of Padova, Italy)
PROGRAMME COMMITTEE:
Johannes Borgström (Uppsala University, Sweden)
Josep Carmona Vargas (Universitat Politecnica de Catalunya, Spain)
Matteo Cimini (LIX - Ecole Polytechnique, France)
Silvia Crafa (University of Padova, Italy)
Wojciech Czerwinski (University of Warsaw, Poland)
Daniel Gebler (VU University Amsterdam, The Nederlands)
Ivan Lanese (University of Bologna, Italy)
Stefan Milius (University of Erlangen-Nurnberg, Germany)
Kirstin Peters (Technical University of Berlin, Germany)
Damien Pous (ENS Lyon, France)
Pawel Sobocinski (University of Southampton, United Kingdom)
Sam Staton (University of Nijmegen, The Nederlands)
Irek Ulidowski (University of Leister, United Kingdom)
************************************************************
More information about the Types-announce
mailing list