M.R. Mousavi | 15 Aug 15:47 2014

Nordic Workshop on Programming Theory (NWPT'14): Call for Papers


Call for Papers 

The 26th Nordic Workshop on Programming Theory, NWPT '14

29-31 October 2014 - Halmstad University, Sweden



The NWPT series of annual workshops is a forum bringing together programming theorists from the Nordic and Baltic countries (but also elsewhere).


Topics of interest include (but are not limited to)

* semantics of programming languages
* programming language design and programming methodology
* programming logics
* formal specification of programs
* program verification
* program construction
* tools for program verification and construction
* program transformation and refinement
* real-time and hybrid systems
* models of concurrency and distributed computing
* language-based security.

=Important Dates=

Tentative deadlines:

* 14 September 2014: Submission of abstracts
* 28 September 2014: Notification
* 5 October  2014: Registration deadline
* 29-31 October 2014: Workshop


Authors wishing to give a talk at the workshop are requested to submit abstracts of 2-3 pages (pdf, printable on A4 paper, using easychair.cls fromhttp://www.easychair.org/easychair.zip) through EasyChair. 
Work in progress as well as abstracts of manuscripts submitted for formal publication elsewhere are permitted.


The abstracts of the accepted contributions will be available at the workshop.

We have arranged a special issue of the [http://www.journals.elsevier.com/journal-of-logical-and-algebraic-methods-in-programming Journal of Logic and Algebraic Methods in Programming] dedicated to 
the best contributions of the journals. 
The contributions will be invited after the workshop and will undergo a rigorous review process according to the stringent rules of JLAMP.

=Invited Speakers=

* Holger Hermanns, Saarland University, Germany
* Anna Ingolfsdottir, Reykjavik University, Iceland 
* Catuscia Palamidessi, INRIA Saclay and École Polytechnique, France

=Program Committee=

*  Luca Aceto, Reykjavík Univ., Iceland 
*  Lars Birkedal, Aarhus Univ., Denmark 
*  Einar Broch Johnsen, Univ. of Oslo, Norway 
*  Michael R. Hansen, DTU, Denmark
*  Keijo Heljanko, Aalto Univ., Finland 
* Fritz Henglein, Univ. of Copenhagen, Denmark 
* Yngve Lamo, Bergen Univ. Col., Norway 
* Kim G. Larsen, Aalborg Univ., Denmark 
* Mohammad Mousavi, Halmstad Univ., Sweden 
* Bengt Nordström, Univ. of Gothenburg, Sweden 
* Olaf Owe, Univ. of Oslo, Norway 
* Paul Pettersson, Mälardalen Univ., Sweden 
* Gerardo Schneider, Chalmers, Sweden 
* Walid Taha, Halmstad Univ., Sweden 
* Tarmo Uustalu, Inst. of Cybernetics, Estonia
* Jüri Vain, Tallinn Univ. of Tech., Estonia 
* Marina Waldén, Åbo Akademi Univ., Finland 
* Uwe Wolter, Univ. of Bergen, Norway 
* Wang Yi, Uppsala Univ., Sweden


The workshop will be held on the campus of Halmstad University  in Halmstad, Sweden.  Halmstad is a popular holiday destination located on the Swedish west coast. 

Direct trains services are available between Halmstad and Göteborg (ca. 75 minutes), and 
between Halmstad and the Malmö-Copenhagen area (incl. Copenhagen Kastrup Airport, in about 2 hours)  
There are also direct daily flights between Halmstad and Stockholm.

The previous editions were held in

* Uppsala (1989, 1999 and 2004),
* Aalborg (1990),
* Göteborg (1991 and 1995),
* Bergen (1992, 2000 and 2012),
* Åbo (1993, 1998, 2003 and 2010),
* Aarhus (1994),
* Oslo (1996, 2007),
* Tallinn (1997, 2002, 2008 and 2013),
* Lyngby (2001 and 2009),
* Copenhagen (2005),
* Reykjavík (2006), and
* Västerås (2011).


* Veronica Gaspes (Organization Chair)
* Mohammad Mousavi (Program Co-Chair)
* Eva Nestius (Local Organization)
* Walid Taha (Program Co-Chair)
Concurrency mailing list
Eric Madelaine | 12 Aug 11:06 2014

Call for Participation, FACS'2014




FACS 2014: 11th International Symposium on Formal Aspects of Component Software

September 9 - September 12, 2014, Bertinoro, Italy


Colocated with iFM 2014: the 11th Internatoinal Conference on Integrated Formal Methods




The FACS series seeks to address the development and application of formal methods in all aspects of software

components and services. Specific topics include:

  • formal models for software components and their interaction
  • formal aspects of services, service oriented architectures, business processes, cloud computing, ensembles, or similar programming artifacts
  • design and verification methods for software components and services
  • composition and deployment: models, calculi, languages
  • formal methods and modeling languages for components and services
  • model based and GUI based testing of components and services
  • models for QoS and other extra-functional properties (e.g., trust, compliance, security) of components and services
  • components for real-time, safety-critical, secure, and/or embedded systems
  • stochastic techniques for modelling and verification
  • simulation techniques for complex networks of interacting components
  • industrial or experience reports, and case studies
  • update and reconfiguration of component and service architectures
  • component systems evolution and maintenance
  • autonomic components and self-managed applications
  • formal and rigorous approaches to software adaptation and self-adaptive systems
  • tools supporting the formal methods for components and services




  • Helmut Veith.  T.U. Wienn, Austria: "Shape and Content: A database-theoretic perspective on the analysis of data structures"

  • Rocco De Nicola. IMT Lucca, Italy: "A formal approach to autonomic systems programming: The SCEL Language"

  • Jean-Bernard Stefani. INRIA Rhônes-Alpes, France: "A process calculus framework for dynamic component structures with sharing"


Colocated Workshops  (http://facs2014.cs.unibo.it/workshops.html)


TTSS: Harnessing Theories for Tools and Software

MOD*: Logics and Model-checking for Self-* Systems

Tools and Methods for Cyber-Physical Systems of Systems

Workshop on Contracts for Efficient and Reliable Services

FM-BIASED: Formal Methods: Business Impact of Application to Security relevant Devices




University Residential Center, Via Frangipane, 6 in Bertinoro, Italy:  http://facs2014.cs.unibo.it/venue.html

Registration on line (Early reg. until Aug. 11th.) through here : http://facs2014.cs.unibo.it/registration.html

Concurrency mailing list
Ina Schaefer | 15 Aug 13:42 2014

University Professorship (W3) in Theoretical Computer Science

The Carl-Friedrich-Gauß-Fakultät der Technischen Universität Braunschweig invites applications for a

University Professorship (Salary Scale W3 BBesO) in Theoretical Computer Science

starting 1 April 2016

The successful candidate should be internationally well-known for his/her research in the area of Theoretical Computer Science. Preference will be given to individuals whose research interests are in one or more of the following fields:
•    Logic and Verification (Formal Analysis, SAT-Solvers, Model Checking, Deduction)
•    Automata, Formal Languages, Complexity, Decidability
•    Machine Learning, Knowledge Discovery, Statistical and Inductive Inference
•    Theoretical Foundations of Complex Distributed Systems

Responsibilities of the future professor also include teaching undergraduate and graduate students within the course of studies Computer Science. The professor is expected to attract external funding and collaborate with in the interdisciplinary environment of Technische Universität Braunschweig.

Conditions of appointment are in accordance with § 25, Niedersachsen Higher Education Act (NHG).

Technische Universität Braunschweig is a member of Niedersachsen Institutes of Technology (NTH), to which the vacant professorship is also assigned. Candidates are therefore expected to participate in coordinated interdisciplinary programmes and to collaborate in research and teaching with the universities in Niedersachsen, and especially within the NTH. For more information on NTH please visit http://en.nth-online.org. Part time employment can be arranged on request.

As an equal opportunities employer, Technische Universität Braunschweig has set itself the strategic aim of significantly increasing the proportion of women. Female scientists are therefore particularly encouraged to apply. Equally qualified candidates with disabilities will be given preference.

The Technische Universität Braunschweig offers first-class infrastructure, regional, national and international cooperation in research and teaching, an exciting work environment with flexible and competitive personnel and budgetary management, and support in technology transfer through the Innovationsgesellschaft TU Braunschweig mbH.
Successful candidates who have reached the age of fifty by the time of appointment and who do not already have civil servant status will be given an employment contract.

Further information is available from the Head of the Search Committee Prof. Dr.-Ing. Ina Schaefer (i.schaefer-3immqusGtKI@public.gmane.org).

Please submit your full application by 30. September 2014 to
Technische Universität Braunschweig
Dekan der Carl-Friedrich-Gauß-Fakultät
Prof. Dr. Thomas Sonar
Rebenring 58A
38106 Braunschweig, Germany

<!-- /* Font Definitions */ <at> font-face {font-family:Arial; panose-1:2 11 6 4 2 2 2 2 2 4; mso-font-charset:0; mso-generic-font-family:auto; mso-font-pitch:variable; mso-font-signature:-536859905 -1073711037 9 0 511 0;} <at> font-face {font-family:"Courier New"; panose-1:2 7 3 9 2 2 5 2 4 4; mso-font-charset:0; mso-generic-font-family:auto; mso-font-pitch:variable; mso-font-signature:-536859905 -1073711037 9 0 511 0;} <at> font-face {font-family:Calibri; panose-1:2 15 5 2 2 2 4 3 2 4; mso-font-charset:0; mso-generic-font-family:auto; mso-font-pitch:variable; mso-font-signature:-520092929 1073786111 9 0 415 0;} <at> font-face {font-family:"Agfa Rotis Sans Serif Light"; mso-font-alt:Cambria; mso-font-charset:0; mso-generic-font-family:auto; mso-font-pitch:variable; mso-font-signature:3 0 0 0 1 0;} /* Style Definitions */ p.MsoNormal, li.MsoNormal, div.MsoNormal {mso-style-unhide:no; mso-style-qformat:yes; mso-style-parent:""; margin-top:0in; margin-right:0in; margin-bottom:13.0pt; margin-left:0in; line-height:13.0pt; mso-pagination:widow-orphan; font-size:10.0pt; mso-bidi-font-size:12.0pt; font-family:Arial; mso-fareast-font-family:"Times New Roman"; mso-bidi-font-family:"Times New Roman"; mso-font-kerning:8.0pt; mso-ansi-language:DE; mso-fareast-language:DE;} pre {mso-style-priority:99; mso-style-link:"HTML Preformatted Char"; margin:0in; margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Courier New"; mso-fareast-font-family:"Times New Roman"; mso-ansi-language:DE; mso-fareast-language:DE;} p.StandardohneLeerzeile, li.StandardohneLeerzeile, div.StandardohneLeerzeile {mso-style-name:"Standard ohne Leerzeile"; mso-style-unhide:no; margin:0in; margin-bottom:.0001pt; line-height:13.0pt; mso-pagination:widow-orphan; font-size:10.0pt; mso-bidi-font-size:12.0pt; font-family:Arial; mso-fareast-font-family:"Times New Roman"; mso-bidi-font-family:"Times New Roman"; mso-font-kerning:8.0pt; mso-ansi-language:DE; mso-fareast-language:DE;} span.HTMLPreformattedChar {mso-style-name:"HTML Preformatted Char"; mso-style-priority:99; mso-style-unhide:no; mso-style-locked:yes; mso-style-link:"HTML Preformatted"; font-family:"Courier New"; mso-ascii-font-family:"Courier New"; mso-fareast-font-family:"Times New Roman"; mso-hansi-font-family:"Courier New"; mso-bidi-font-family:"Courier New"; mso-ansi-language:DE; mso-fareast-language:DE;} p.LUHText, li.LUHText, div.LUHText {mso-style-name:LUH_Text; mso-style-priority:99; mso-style-unhide:no; margin:0in; margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:11.0pt; mso-bidi-font-size:16.5pt; font-family:"Agfa Rotis Sans Serif Light"; mso-fareast-font-family:"Times New Roman"; mso-bidi-font-family:"Times New Roman"; mso-ansi-language:DE; mso-fareast-language:DE;} .MsoChpDefault {mso-style-type:export-only; mso-default-props:yes; font-size:10.0pt; mso-ansi-font-size:10.0pt; mso-bidi-font-size:10.0pt; font-family:Calibri; mso-ascii-font-family:Calibri; mso-fareast-font-family:Calibri; mso-hansi-font-family:Calibri;} <at> page WordSection1 {size:595.3pt 841.9pt; margin:70.85pt 70.85pt 56.7pt 70.85pt; mso-header-margin:35.4pt; mso-footer-margin:35.4pt; mso-paper-source:0;} div.WordSection1 {page:WordSection1;} /* List Definitions */ <at> list l0 {mso-list-id:2017464818; mso-list-type:hybrid; mso-list-template-ids:1231350004 -425551064 67567619 67567621 67567617 67567619 67567621 67567617 67567619 67567621;} <at> list l0:level1 {mso-level-number-format:bullet; mso-level-text:&#61623;; mso-level-tab-stop:22.7pt; mso-level-number-position:left; margin-left:22.7pt; text-indent:-22.7pt; font-family:Symbol; color:windowtext;} <at> list l0:level2 {mso-level-tab-stop:1.0in; mso-level-number-position:left; text-indent:-.25in;} <at> list l0:level3 {mso-level-tab-stop:1.5in; mso-level-number-position:left; text-indent:-.25in;} <at> list l0:level4 {mso-level-tab-stop:2.0in; mso-level-number-position:left; text-indent:-.25in;} <at> list l0:level5 {mso-level-tab-stop:2.5in; mso-level-number-position:left; text-indent:-.25in;} <at> list l0:level6 {mso-level-tab-stop:3.0in; mso-level-number-position:left; text-indent:-.25in;} <at> list l0:level7 {mso-level-tab-stop:3.5in; mso-level-number-position:left; text-indent:-.25in;} <at> list l0:level8 {mso-level-tab-stop:4.0in; mso-level-number-position:left; text-indent:-.25in;} <at> list l0:level9 {mso-level-tab-stop:4.5in; mso-level-number-position:left; text-indent:-.25in;} ol {margin-bottom:0in;} ul {margin-bottom:0in;} --> -- -- Prof. Dr.-Ing. Ina Schaefer Institut für Softwaretechnik und Fahrzeuginformatik Technische Universität Braunschweig Mühlenpfordtstr. 23 D-38106 Braunschweig Germany Tel: +49-531-391-2275 Fax: +49-531-391-2277 URL: http://www.tu-braunschweig.de/isf
Concurrency mailing list
Emil Sekerinski | 12 Aug 14:42 2014

Integrated Formal Methods 2014 - Call for Participation


11th International Conference on integrated Formal Methods, iFM 2014

Co-located with the 11th International Symposium on  Formal Aspects of Component Software, FACS 2014

9 - 12 September 2014, Bertinoro, Italy


Applying formal methods may involve modeling different aspects of a system which are best expressed using different formalisms. Correspondingly, different analysis techniques may be used to examine different system views, different kinds of properties, or simply in order to cope with the sheer complexity of the system. The iFM conference series seeks to further research into hybrid approaches to formal modeling and analysis; i.e., the combination of (formal and semi-formal) methods for system development, regarding modeling and analysis, and covering all aspects from language design through verification and analysis techniques to tools and their integration into software engineering practice. 


iFM 2014 is organized by the University of Bologna and will take place at the Centro Residenziale Universitario in Bertinoro, a small medieval hilltop town 50 km east of Bologna. The conference program includes a visit of “Rocca” with a welcome cocktail on Tuesday, 9 September and a visit of “Fattoria Paradiso" with social dinner on Wednesday, 10 September.


Registration to the conference and workshops, as well as hotel reservation, is directly managed by the Centro Residenziale Universitario in Bertinoro, see: http://ifm2014.cs.unibo.it/registration.html


iFM 2014 has the following keynote speakers jointly with FACS 2014: 
  • Sophia Drossopoulou (Imperial College): Towards Capability Policy Specification and Verification
  • Rocco De Nicola (IMT Lucca): A formal approach to autonomic systems programming: The SCEL Language
  • Helmut Veith (TU Wien): Shape and Content: A database-theoretic perspective on the analysis of data structures
  • Jean-Bernard Stefani (INRIA): TBA


Tool Integration:
  • Marcel Vinicius Medeiros Oliveira, Augusto Sampaio and Madiel Conserva. Model-checking Circus State-Rich Specifications
  • Martin Hentschel, Stefan Käsdorf, Reiner Hähnle and Richard Bubel. An interactive verification tool meets an IDE
  • Andrea Vandin, Mirco Tribastone and Stephen Gilmore. An Analysis Pathway for the Quantitative Evaluation of Public Transport Systems
  • Messaoud Abbas, Choukri-Bey Ben-Yelles and Renaud Rioboo. Modeling UML template classes with FoCaLiZe
  • Linas Laibinis, Benjamin Byholm, Inna Pereverzeva, Elena Troubitsyna, Kuan Eeik Tan and Ivan Porres. Integrating Event-B Modelling and Discrete Event Simulation to Analyse Resilience of Data Stores in the Cloud
  • Asieh Salehi Fathabadi, Colin Snook and Michael Butler. Applying an Integrated Modelling Process to Run-time Management of Many-Core Systems

Model Verification:
  • Yael Meller, Orna Grumberg and Karen Yorav. Verifying Behavioral UML Systems via CEGAR
  • Alvaro Miyazawa and Ana Cavalcanti. Formal refinement in SysML
  • Hadrien Bride, Olga Kouchnarenko and Fabien Peureux. Verifying Modal Workflow Specifications using Constraint Solving

Program Development:
  • Johannes Eriksson, Masoumeh Parsa and Ralph-Johan Back. Proofs and Refutations in Invariant-Based Programming
  • Dipak L. Chaudhari and Om Damani. Automated Theorem Prover Assisted Program Calculations
  • Steve Schneider, Helen Treharne, Heike Wehrheim and David M. Williams. Managing LTL properties in Event-B refinement

Security Analysis:
  • Alessandro Bruni, Michal Sojka, Flemming Nielson and Hanne Riis Nielson. Formal and Experimental Security Analysis of the MaCAN Protocol
  • Barbara Kordy, Patrick Schweitzer and Marc Pouly. A Probabilistic Framework for  Security Scenarios with Dependent Actions
  • John Ramsdell, Daniel Dougherty, Joshua Guttman and Paul Rowe. A Hybrid Analysis for Security Protocols with State

Analysis and Transformation:
  • Irina Mariuca Asavoae, Mihail Asavoae and Adrian Riesco. Towards a Formal Semantics-Based Technique for Interprocedural Slicing
  • Marie-Christine Jakobs, Marco Platzner, Heike Wehrheim and Tobias Wiersema. Integrating Software and Hardware Verification
  • Andreas Fürst, Thai Son Hoang, David Basin, Krishnaji Desai, Naoto Sato and Kunihiko Miyazaki. Code Generation for Event-B

Concurrency and Control:
  • John Derrick, Graeme Smith and Brijesh Dongol. Verifying Linearizability on TSO Architectures
  • Bogdan Tofan, Gerhard Schellhorn and Wolfgang Reif. A Compositional Proof Method for Linearizability Applied to a Wait-Free Multiset
  • Lucian Patcas, Mark Lawford and Tom Maibaum. A Separation Principle for Embedded System Interfacing


Harnessing Theories for Tool Support in Software (TTSS), 9 September 2014:

Logics and Model-checking for Self-* Systems (MOD*),12 September 2014:
  • http://modstar.cs.unibo.it
  • Marcello M. Bersani, Politecnico di Milano, Italy (Organizer)
  • Davide Bresolin, University of Bologna, Italy (Organizer)
  • Luca Ferrucci, Politecnico di Milano, Italy (Organizer)
  • Manuel Mazzara, Politecnico di Milano, Italy (Organizer)

Tools and Methods for Cyber-Physical Systems of Systems,12 September 2014:
  • http://www.cpsos.eu
  • John Fitzgerald, Newcastle University, UK (Organizer)
  • Wan Fokkink, VU University Amsterdam, The Netherlands (Organizer)
  • Michel Reniers, Technical University Eindhoven, The Netherlands (Organizer)

Workshop on Contracts for Efficient and Reliable Services, 12 September 2014

Formal Methods: Business Impact of Application to Security relevant Devices (FM-BIASED), 9 September 2014:
  • http://www.fm-biased.eu
  • Beatrice Albè, Novareckon S.R.L., Italy (Organizer)
  • Alberto Stefanini, Novareckon S.R.L., Italy (Organizer)

  • Gianluigi Zavattaro, University of Bologna, Italy

  • Elvira Albert, Complutense University of Madrid, Spain
  • Emil Sekerinski, McMaster University, Canada

  • Elena Giachino, University of Bologna, Italy

  • Erika Abraham, RWTH Aachen University, Germany
  • Clara Benac, Technical University of Madrid, Spain
  • Ana Cavalcanti, University of York, UK
  • Frank de Boer, CWI Amsterdam, Netherlands
  • Eerke Boiten, University of Kent, UK
  • Michael Butler, University of Southampton, UK
  • David Déharbe, Federal University of Rio Grande do Norte, Brazil
  • John Derrick, University of Sheffield, UK
  • Marc Frappier, University of Sherbrooke, Canada
  • Elena Giachino, University of Bologna, Italy
  • Susanne Graf, Verimag, France
  • John Hatcliff, Kansas State University, USA
  • Einar Broch Johnsen, University of Oslo, Norway
  • Rajeev Joshi, NASA Jet Propulsion Laboratory, USA
  • Laura Kovács, Chalmers University of Technology, Sweden
  • Diego Latella, National Research Council, Pisa, Italy
  • Stefan Leue, University of Konstanz, Germany
  • Shaoying Liu, Hosei University, Japan
  • Dominique Mery, LORIA and University of Lorraine, France
  • Antoine Mine, Ecole Normale Supérieur, France
  • Luigia Petre, Åbo Akademi University, Finland 
  • Guillermo Román Díez, Technical University of Madrid, Spain
  • Fernando Rosa, Complutense University of Madrid, Spain
  • Augusto Sampaio, University of Pernambuco, Brazil
  • Thomas Santen, European Microsoft Innovation Center, Germany
  • Steve Schneider, University of Surrey, UK
  • Graeme Smith, University of Queensland, Australia
  • Kenji Taguchi, AIST, Japan
  • Tayssir Touili, University Paris Diderot, France
  • Helen Treharne, University of Surrey, UK 
  • Jüri Vain, Tallinn University of Technology, Estonia
  • Heike Wehrheim, University of Paderborn, Germany
  • Peter Wong, Fredhopper B.V., Netherlands

Concurrency mailing list
Sicco Verwer | 8 Aug 10:02 2014

PhD vacancy: Learning Timed Automata for Fast Activity Detection

PhD: Learning Timed Automata for Fast Activity Detection
Department/faculty: Electrical Engineering, Mathematics and Computer Science
Level: Master degree
Working hours: 38 hours per week
Contract: 4 years
Salary: €2083 to €2664 per month gross
Electrical Engineering, Mathematics and Computer Science

The Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) is known worldwide for its high academic quality and the social relevance of its research programmes. The faculty’s excellent facilities accentuate its international position in teaching and research. The faculty offers an interdisciplinary setting for its 500 employees, 400 PhD students and 1700 undergraduates. Together they work on a broad range of technical innovations in the fields of sustainable energy, telecommunications, microelectronics, embedded systems, computer and software engineering, interactive multimedia and applied mathematics. EEMCS: Your Connection to the Future.

The Department of Intelligent Systems (INSY) conducts research on processing, interpretation and securing of data to enable man and machine to deal with the increasing volume and complexity of data and communication. We have a strong focus on security, multimedia, and health sciences. The cybersecurity section in INSY is a collaborative effort with the Technology, Policy, and Management (TPM) faculty to solve complex security issues from both a computer scientist’s and a policy maker's viewpoint.

The cybersecurity research at INSY is focussed on secure data processing and machine learning: we aim to hide sensitive data by means of cryptography and to discover malicious activities through data analytics. We develop new algorithms and encryption schemes with applications in networks, forensics, healthcare, and vital infrastructures. We teach cryptography, data analytics, and cyber forensics courses in the Computer Science, Mathematics and Electrical Engineering graduate programme.
Job description

Under the guidance of Dr. Sicco Verwer you will research and develop the technology needed for semi-supervised learning of probabilistic timed automata (building upon http://repository.tudelft.nl/view/ir/uuid:61d9f199-7b01-45be-a6ed-04498113a212/). The algorithms developed will be used in a joint research project with Prof. VS Subrahmanian from the University of Maryland on fast activity detection in massive streams of timestamped observation data (seehttp://www.umiacs.umd.edu/research/CDIG/projects/adetect.html). Ongoing collaborations between the cybersecurity group and several industrial partners will provide computer network data that will be used to learn and detect timed patterns for cyber attacks and botnet traffic, amongst others in industrial control systems (SCADA) for critical infrastructures.

You will:
• Improve and implement state-of-the-art state machine (automata) learning algorithms.
• Use these algorithms to enhance the security of computer systems and society.
• Write scientific papers describing this work.
• Join an enthusiastic team of researchers working on learning state machines (automata) for cyber security.
• Participate in the TU Delft graduate school.
• Work towards obtaining a PhD degree.

We invite applicants who meet the following requirements:
You have an MSc. degree in computer science, artificial intelligence, or mathematics.
You have excellent programming skills.
You are enthusiastic about (state) machine learning and security.
You have a good understanding of spoken and written English.
Having some background in network security, machine learning, or probabilistic modelling is a plus.
Conditions of employment

TU Delft offers an attractive benefits package, including a flexible work week, free high-speed Internet access from home (with a contract of two years or longer), and the option of assembling a customised compensation and benefits package (the 'IKA'). Salary and benefits are in accordance with the Collective Labour Agreement for Dutch Universities.
As a PhD candidate you will be enrolled in the TU Delft Graduate School. TU Delft Graduate School provides an inspiring research environment; an excellent team of supervisors, academic staff and a mentor; and a Doctoral Education Programme aimed at developing your transferable, discipline-related and research skills. Please visit www.phd.tudelft.nl for more information.
Information and application

For more information about this position, please contact Dr. Sicco Verwer, phone: +31 (0)15-2788435, e-mail:S.E.Verwer-hGVxb2UgFK3z+pZb47iToQ@public.gmane.org To apply, please e-mail a detailed CV along with a letter of application by 31 August 2014 to Ms. C. Kohlmann-van Noord, Hr-eemcs <at> tudelft.nl.
When applying for this position, please refer to vacancy number EWI2014-18.
Concurrency mailing list
Wojciech Mostowski | 7 Aug 15:47 2014

AVoCS 2014: 1st Call for Participation

(Apologies for multiple copies)


Call for Participation

14th Automated Verification of Critical Systems (AVoCS) 2014 Workshop


24-26th September, 2014

University of Twente, Netherlands


Call for Participation

The aim of Automated Verification of Critical Systems (AVoCS) 2014 is
to contribute to the interaction and exchange of ideas among members
of the international research community on tools and techniques for
the verification of critical systems. The subject is to be interpreted
broadly and inclusively. It covers all aspects of automated
verification, including model checking, theorem proving, SAT/SMT
constraint solving, abstract interpretation, and refinement pertaining
to various types of critical systems which need to meet stringent
dependability requirements (safety-critical, business-critical,
performance-critical, etc.). Contributions that describe different
techniques, or industrial case studies are encouraged. The technical
programme will consist of invited and contributed talks and also allow
for short presentations of research ideas. The workshop will be
relatively informal, with an emphasis on discussion.

AVoCS topics include (but are not limited to)

     Model Checking
     Automatic and Interactive Theorem Proving
     SAT, SMT or Constraint Solving for Verification
     Abstract Interpretation
     Specification and Refinement
     Requirements Capture and Analysis
     Verification of Software and Hardware
     Specification and Verification of Fault Tolerance and Resilience
     Probabilistic and Real-Time Systems
     Dependable Systems
     Verified System Development
     Industrial Applications

Thanks to Formal Methods Europe (http://www.fmeurope.org/), we offer a
financial support for students registering for AVoCS in the form of a
registration fee waiver (full or partial). Because our financial support
is limited, we ask the students that would like to take the advantage of
this support to submit a short application (deadline August 14th). The
details on how to apply can be found on the AVoCS 2014 webpage

AVoCS 2014 is coorganised and colocated with SPES_XT Summer School
on Model-based design and analysis of cyber-physical systems:


A registration reduction is offered for participants attending both events.

The workshop will have three invited speakers:

   Laura Kovacs (Chalmers, Sweden) will speak about automated assertion
   Alastair Donaldson (Imperial College, U.K.) will speak about
     verification of OpenCL kernels.
   Guy Broadfoot (U.K.) will speak about fighting the battle to get
     industry to adopt formal based tools.

Important Dates

   Student grant application: 14th August 2014
   Early registration: 1st September 2014

   Workshop: 24-26th September 2014 (2.5 days, ends 26th lunchtime)

Registration Details

All the details on how to register and pay are to be found at the 
workshop page at

Research Presentations

The following is the list of full research papers that will be presented at
AVoCS 2014:

Jan Friso Groote, Remco Van Der Hofstad and Matthias Raffelsieper.
   On the Random Structure of Behavioural Transition Systems

Paolo Arcaini, Angelo Gargantini and Elvinia Riccobene.
   Using SMT for dealing with nondeterminism in ASM-based runtime

Jingshu Chen, Marie Duflot and Stephan Merz.
   Analyzing Conflict Freedom for Multithreaded Programs with Time

Morteza Mohaqeqi, Mohammadreza Mousavi and Walid Taha.
   Conformance Testing of Cyber-Physical Systems: A Comparative Study

Petr Ročkai, Jiří Barnat and Luboš Brim.
   Model Checking C++ with Exceptions

Leo Hatvani, Alexandre David, Cristina Seceleanu and Paul Pettersson.
   Adaptive Task Automata with Earliest-Deadline-First Scheduling

Sven Reimer, Matthias Sauer, Paolo Marin and Bernd Becker.
   QBF with Soft Variables

Adisak Intana, Michael Poppleton and Geoff Merrett.
   A Formal Co-Simulation Approach for Wireless Sensor Network

John Mullins and Béatrice Bérard.
   Verification of Information Flow Properties under Rational Observation

Jeremy Sproston.
   Exact and Approximate Abstraction for Classes of Stochastic Hybrid

Ernst Moritz Hahn, Arnd Hartmanns and Holger Hermanns.
   Reachability and Reward Checking for Stochastic Timed Automata

Renaud De Landtsheer, Christophe Ponsard, Nicolas Devos, Bénédicte
Moriau and Guy Anckaerts.
   A Constraint-Solving Approach for Achieving Minimal-Reset Transition
   Coverage of Smartcard Behaviour

Ali Jafari, Ehsan Khamespanah, Marjan Sirjani and Holger Hermanns.
   Performance Analysis of Distributed and Asynchronous Systems using
   Probabilistic Timed Actors

Steering Committee

   Michael Goldsmith, University of Oxford, U.K.
   Stephan Merz, INRIA Nancy & LORIA, France
   Markus Roggenbach, Swansea University, U.K.

Organization Committee

   Marieke Huisman
   Wojciech Mostowski (publicity chair)
   Jaco van de Pol


Wojciech Mostowski
University of Twente
Formal Methods and Tools, EWI
EWI-FMT, P.O. Box 217, 7500AE Enschede, The Netherlands
e-mail: w.mostowski <at> utwente.nl
www: http://wwwhome.ewi.utwente.nl/~mostowskiwi/
tel: +31-53-489 3640
fax: +31-53-489 3247
Concurrency mailing list
Concurrency <at> listserver.tue.nl
Ylies Falcone | 28 Jul 21:26 2014

RV 2014: Call for Participation




RV 2014: 14th International Conference on Runtime Verification

September 22 - September 25, 2014, Toronto, Canada






Runtime verification is concerned with monitoring and analysis of software and hardware system executions. Runtime verification techniques are important for system correctness, reliability, and robustness; they are complementary to conventional testing, and more practical than exhaustive formal verification. Runtime verification can be used prior to deployment, for testing, verification, and debugging purposes, and after deployment for ensuring reliability, safety, and security and for providing fault containment and recovery as well as online system repair. Topics of interest to the conference include:

  • specification languages
  • specification mining
  • program instrumentation
  • monitor construction techniques
  • logging, recording, and replay
  • fault detection, localization, containment, recovery and repair
  • program steering and adaptation
  • metrics and statistical information gathering
  • combination of static and dynamic analyses
  • program execution visualization
  • monitoring techniques for safety/mission-critical systems
  • monitoring distributed systems, cloud services, and big data applications
  • monitoring security and privacy policies

Application areas of runtime verification include safety/mission-critical systems, enterprise and systems software, autonomous and reactive control systems, health management and diagnosis systems, and system security and privacy.




  • Kevin Driscoll
    Fellow at Honeywell Labs, USA
    Murphy Strikes Again
  • Assaf Schuster
    Professor of Computer Science, Computer Science Department, Technion, Israel
    Monitoring Big, Distributed, Streaming Data
  • Jeannette Wing
    President's Professor of Computer Science,
    Computer Science Department, Carnegie Mellon University, USA
    Formal Methods: An Industrial Perspective




  • Vijay K. Garg & Neeraj Mittal
    UT at Austin & UT at Dallas
    A Lattice-Theoretic Approach to Monitoring Distributed Computations
  • David Basin & Felix Klaedtke
    ETH-Zurich & NEC Labs, Europe
    Runtime Monitoring and Enforcement of Security Policies




The Fields Institute for Research in Mathematical Sciences

222 College Street, Toronto, Ontario, Canada





Registration on line to Aug. 21, on site Sept. 22

Registration fees $575, after Aug. 21 $675

Student $350, after Aug. 21, $450

Fees include proceedings and 1x Conference banquet

Additional banquet tickets $80

Registration link:





  • Pierre Fraigniaud, Sergio Rajsbaum and Corentin Travers. 
    On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems
  • Simon Varvaressos, Kim Lavoie, Sebastien Gaboury and Sylvain Hallé.
    Multiple Ways to Fail: Generalizing a Monitor's Verdict for the Classification of Execution Traces
  • Clemens Ballarin.
    Two Generalisations of Roşu and Chen's Trace Slicing Algorithm A
  • Martin Hentschel, Richard Bubel and Reiner Hähnle.
    Symbolic Execution Debugger (SED) 
  • Jiannan Zhai, Nigamanth Sridhar and Jason Hallstrom.
    Supporting the Specification and Runtime Validation of Asynchronous Calling Patterns in Reactive Systems 
  • Emmanouil Koukoutos and Viktor Kuncak.
    Checking Data Structure Properties Orders of Magnitude Faster 
  • Maria Christakis, Patrick Emmisberger and Peter Müller.
    Dynamic Test Generation with Static Fields and Initializers 
  • Aravind Sukumaran-Rajam, Juan Manuel Martinez Caamano, Willy Wolff, Alexandra Jimborean and Philippe Clauss.
    Speculative Program Parallelization with Scalable and Decentralized Runtime Verification 
  • Christian Colombo and Yliès Falcone.
    Organising LTL Monitors over Distributed Systems with a Global Clock 
  • Erdal Mutlu, Vladimir Gajinov, Adrian Cristal, Serdar Tasiran and Osman Unsal.
    Dynamic Verification for Hybrid Concurrent Programming Models 
  • Hsi-Ming Ho, Joel Ouaknine and James Worrell.
    Online Monitoring of Metric Temporal Logic
  • David Basin, Germano Caronni, Sarah Ereth, Matúš Harvan, Felix Klaedtke and Heiko Mantel.
    Scalable Offline Monitoring 
  • David Basin, Felix Klaedtke, Srdjan Marinovic and Eugen Zalinescu.
    On Real-time Monitoring with Imprecise Timestamps 
  • Anand Yeolekar.
    Improving dynamic inference with variable dependence graph 
  • Ming Chai and Holger Schlingloff.
    Monitoring Systems with Extended Live Sequence Charts 
  • Laura Bozzelli and César Sánchez.
    Foundations of Boolean Stream Runtime Verification 
  • Mitra Tabaei Befrouei, Chao Wang and Georg Weissenbacher.
    Abstraction and Mining of Traces to Explain Concurrency-Bugs 
  • Stefan Mitsch and André Platzer.
    ModelPlex: Verified Runtime Validation of Verified Cyber-Physical System Models 
  • Johannes Geist, Kristin Y. Rozier and Johann Schumann.
    Runtime Observer Pairs and Bayesian Network Reasoners On-board FPGAs: Flight-Certifiable System Health Management for Embedded Systems 
  • Malte Isberner, Falk Howar and Bernhard Steffen
    The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning
  • Kim Lavoie, Corentin Leplongeon, Simon Varvaressos, Sebastien Gaboury and Sylvain Hallé.
    Portable Runtime Verification with Smartphones and Optical Codes 
  • Adel Dokhanchi, Bardh Hoxha and Georgios Fainekos
    On-Line Monitoring for Temporal Logic Robustness 
  • Jeff Huang, Cansu Erdogan, Yi Zhang, Brandon Moore, Qingzhou Luo, Aravind Sundaresan and Grigore Rosu.
    ROSRV: Runtime Verification for Robots 
  • Qingzhou Luo, Yi Zhang, Choonghwan Lee, Dongyun Jin, Patrick Meredith, Traian Serbanuta and Grigore Rosu.
    RV-Monitor: Efficient Parametric Runtime Verification with Simultaneous Properties 
  • Duc Hiep Chu, Joxan Jaffar and Vijayaraghavan Murali.
    Lazy Symbolic Execution for Enhanced Learning 
  • Kuei Sun, Daniel Fryer, Ashvin Goel, Dai Qin and Angela Demke Brown.
    Robust Consistency Checking for Modern Filesystems 
  • Ayoub Nouri, Balaji Raman, Marius Bozga, Axel Legay and Saddek Bensalem.
    Faster Statistical Model Checking by Means of Abstraction and Learning




  • General Chair: Sebastian Fischmeister (University of Waterloo, Canada).
  • PC co-Chairs: 
    • Borzoo Bonakdarpour (McMaster University, Canada)
    • Scott Smolka (Stony Brook Universtiy, USA)
  • Tools Track Chair: Ezio Bartocci (TU Vienna, Austria)
  • Runtime Monitoring Competition Co-Chairs:
    • Ezio Bartocci (TU Vienna, Austria)
    • Borzoo Bonakdarpour (McMaster University, Canada)
    • Ylies Falcone (Université Joseph Fourier, France)
  • Publicity Chair: Ylies Falcone (Université Joseph Fourier, France)
  • Local Arrangements Chair: Patrick Lam (University of Waterloo, Canada)




More information about RV2014 is available from the conference web site:


Concurrency mailing list
Emiliano Tramontana | 26 Jul 10:53 2014

Call for Papers PSC track at SAC 2015


Programming for Separation of Concerns (PSC) Track at ACM SAC 2015


Important Dates
Paper Due September 12, 2014
Student Research Abstract Due September 12, 2014

Author Notification November 17, 2014
Camera Ready Dicember 8, 2014
Registration Dicember 15, 2014

Conference in Salamanca, Spain April 13-17, 2015

Call for Papers

Modularity issues tackled by Separation of Concerns (SoC) techniques such as computational reflection,
aspect-oriented programming (AOP), subject-oriented programming (SOP) and context-oriented
programming (COP) have been successfully employed to produce systems whose concerns are well
separated, thereby facilitating reuse and evolution of system components or systems as a whole.

The Programming for Separation of Concerns (PSC) track at the 2015 Symposium on Applied Computing (SAC)
aims to explore challenges that developers currently face when using SoC techniques during development
and evolution.

This year we aim at finding whether solutions based on SoC techniques can be appropriate for dealing with
distributed and parallel systems, such as cloud computing and GPGPUs.  Moreover, we aim at finding out how
to change legacy systems in order to improve their modularity, hence the techniques helping
rejuvenation.  In this sense, we encourage submissions related with strategies that aim at tackling the
discovery of faults related with distribution, parallelisation and ageing.  The track will address
questions like: how such techniques cope with architectural erosion? Are these techniques helpful to
deal with evolution of legacy systems?  Is there a need to extend current technologies supporting SoC?

Authors are invited to submit original papers. Submissions are encouraged, but not limited, to the
following topics:
- Software architectures 
- Configuration management systems
- Software reuse and evolution of legacy systems
- Performance issues for metalevel and aspect-oriented systems (AOSD)
- Testing of aspect-based systems
- Mining of faults on aspect-based systems
- Consistency, integrity and security
- Generative approaches
- Analysis and evaluation of software systems
- Experiences in using reflection, composition filters, aspect- subject- and feature- orientation, and change-oriented-software-engineering
- Reflective and aspect-oriented middleware for distributed systems
- Language support for aspect-oriented and SoC systems
- Modelling of SoC techniques to allow predictable outcomes from their use
- Formal methods for metalevel and SoC systems

Submission Guidelines

Original papers from the above mentioned or other related areas will be considered. Only full papers about
original and unpublished research are sought.  Parallel submission to other conferences or tracks is not acceptable.

Papers can be submitted in electronic format via the SAC website within 12 September 2014.  http://www.acm.org/conferences/sac/sac2015/Paper-SubmissionUploadPage.htm
Please make sure that the authors name and affiliation do not appear on the submitted paper.

Peer groups with expertise in the track focus area will blindly review submissions to the track.

At least one author of the accepted paper should register and participate in the PSC track.  Accepted papers
will be published in the annual conference ACM proceedings.

The camera-ready version of the accepted paper should be prepared using the ACM format (guidelines will be
given on the SAC website). The maximum number of pages allowed for the final papers is six (6), with the
option, at additional cost, to add two (2) more pages.

A set of papers submitted to the PSC track and not accepted as full papers will be selected as poster papers
and published in the ACM proceedings as 2-page papers, with the option, at additional cost, to add one (1)
more page.

Paper registration is required, allowing the inclusion of the paper/poster in the conference
proceedings. An author or a proxy attending SAC MUST present the paper.  This is a requirement for the
paper/poster to be included in the ACM/IEEE digital library.  No-show of scheduled papers and posters
will result in excluding them from the ACM/IEEE digital library.

Student Research Competition

Graduate students are invited to submit their work as abstract research paper within within 12 September
2014 (minimum two pages, maximum four pages). The work has to be authored by one student only. The abstract
should reflect on the originality and innovation of the approach, and applicability of preliminary
results to real-world problems. All abstracts must be submitted via SAC website.

Authors of selected abstracts are eligible to apply to the SIGAPP Student Travel Award program for support.

Please contact the track chairs for any further information needed.

Concurrency mailing list

Luca Bortolussi | 1 Aug 17:34 2014

QAPL-TCS special issue, 2nd call for papers


Quantitative Aspects of Programming Languages and Systems (QAPL 2013/14)



We invite the submission of papers on Quantitative Aspects of
Programming Languages and Systems for publication in a special issue
of the Journal of Theoretical Computer Science (TCS). In particular we
welcome papers which are revised versions of the submitted to and
presented at the QAPL 2013 Workshop in Rome and QAPL 2014 in
Grenoble. We will additionally also welcome submissions of papers not
presented at QAPL, provided they fall into the scope of the call.


Quantitative aspects of computation are important and sometimes
essential in characterising the behaviour and determining the
properties of systems. They are related to the use of physical
quantities (storage space, time, bandwidth, etc.) as well as
mathematical quantities (e.g. probability and measures for
reliability, risk and trust). Such quantities play a central role in
defining both the model of systems (architecture, language design,
semantics) and the methodologies and tools for the analysis and
verification of system properties. This special issue will be devoted
to research papers which discuss the explicit use of quantitative
information such as time and probabilities either directly in the
model or as a tool for the analysis of systems. In particular,
contributions should focus on

* the design of probabilistic and real-time languages and the
  definition of semantical models for such languages;

* the discussion of methodologies for the analysis of probabilistic
  and timing properties (e.g. security, safety, schedulability) and of
  other quantifiable properties such as reliability (for hardware
  components), trustworthiness (in information security) and resource
  usage (e.g. worst-case memory/stack/cache requirements);

* the probabilistic analysis of systems which do not explicitly
  incorporate quantitative aspects (e.g. performance, reliability and
  risk analysis);

* applications to safety-critical systems, communication protocols,
  control systems, asynchronous hardware, and to any other domain
  involving quantitative issues.

* the investigation of computational models and paradigms involving
  quantitative aspects, such as those arising in quantum computation,
  systems biology, bioinformatics, etc.


Topics include (but are not limited to) probabilistic, timing and
general quantitative aspects in:

Language design, language expressiveness, quantitative language
extension, semantics, logic, verification, automated reasoning,
testing, model-checking, program analysis, performance analysis,
resource analysis, safety, security and protocol analysis, risk and
hazard analysis, for biological systems, quantum languages,
information systems, multi-tasking and multi-core systems,
time-critical systems, embedded systems, coordination models,
scheduling theory, distributed systems, concurrent systems, etc.


Papers should be 20-25 pages long, including appendices, and should be
formatted according to Elsevier's elsart document style used for articles in
the Journal of Theoretical Computer Science (see the Guide for Authors at


Submissions are through Easychair  at:

Authors are encouraged to submit an abstract before the deadline, to speed up
the reviewing process.

          * Paper submission: 31 August 2014
          * Notification (first round): end of 2014


          Nathalie Bertrand
          Inria, Rennes, France 

	  Luca Bortolussi
	  University of Trieste, Italy

	  Herbert Wiklicky
	  Imperial College London, UK


Luca Bortolussi

Concurrency mailing list

GRLMC | 26 Jul 16:07 2014

LATA 2015: 1st call for papers

*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line*



LATA 2015

Nice, France

March 2-6, 2015

Organized by:
CNRS, I3S, UMR 7271
Nice Sophia Antipolis University

Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University




LATA is a conference series on theoretical computer science and its applications. Following the
tradition of the diverse PhD training events in the field developed at Rovira i Virgili University in
Tarragona since 2002, LATA 2015 will reserve significant room for young scholars at the beginning of
their career. It will aim at attracting contributions from classical theory fields as well as
application areas.


LATA 2015 will take place in Nice, the second largest French city on the Mediterranean coast. The venue will
be the University Castle at Parc Valrose.


Topics of either theoretical or applied interest include, but are not limited to:

algebraic language theory
algorithms for semi-structured data mining
algorithms on automata and words
automata and logic
automata for system analysis and programme verification
automata networks
automata, concurrency and Petri nets
automatic structures
cellular automata
combinatorics on words
computational complexity
data and image compression
descriptional complexity
digital libraries and document engineering
foundations of finite state technology
foundations of XML
fuzzy and rough languages
grammars (Chomsky hierarchy, contextual, unification, categorial, etc.)
grammatical inference and algorithmic learning
graphs and graph transformation
language varieties and semigroups
language-based cryptography
parallel and regulated rewriting
power series
string and combinatorial issues in bioinformatics
string processing algorithms
symbolic dynamics
term rewriting
trees, tree languages and tree automata
unconventional models of computation
weighted automata


LATA 2015 will consist of:

invited talks
invited tutorials
peer-reviewed contributions


to be announced


Andrew Adamatzky (West of England, Bristol, UK)
Andris Ambainis (Latvia, Riga, LV)
Franz Baader (Dresden Tech, DE)
Rajesh Bhatt (Massachusetts, Amherst, US)
José-Manuel Colom (Zaragoza, ES)
Bruno Courcelle (Bordeaux, FR)
Erzsébet Csuhaj-Varjú (Eötvös Loránd, Budapest, HU)
Aldo de Luca (Naples Federico II, IT)
Susanna Donatelli (Turin, IT)
Paola Flocchini (Ottawa, CA)
Enrico Formenti (Nice, FR)
Tero Harju (Turku, FI)
Monika Heiner (Brandenburg Tech, Cottbus, DE)
Yiguang Hong (Chinese Academy, Beijing, CN)
Kazuo Iwama (Kyoto, JP)
Sanjay Jain (National Singapore, SG)
Maciej Koutny (Newcastle, UK)
Antonín Kučera (Masaryk, Brno, CZ)
Thierry Lecroq (Rouen, FR)
Salvador Lucas (Valencia Tech, ES)
Veli Mäkinen (Helsinki, FI)
Carlos Martín-Vide (Rovira i Virgili, Tarragona, ES, chair)
Filippo Mignosi (L’Aquila, IT)
Victor Mitrana (Madrid Tech, ES)
Ilan Newman (Haifa, IL)
Joachim Niehren (INRIA, Lille, FR)
Enno Ohlebusch (Ulm, DE)
Arlindo Oliveira (Lisbon, PT)
Joël Ouaknine (Oxford, UK)
Wojciech Penczek (Polish Academy, Warsaw, PL)
Dominique Perrin (ESIEE, Paris, FR)
Alberto Policriti (Udine, IT)
Sanguthevar Rajasekaran (Connecticut, Storrs, US)
Jörg Rothe (Düsseldorf, DE)
Frank Ruskey (Victoria, CA)
Helmut Seidl (Munich Tech, DE)
Ayumi Shinohara (Tohoku, Sendai, JP)
Bernhard Steffen (Dortmund, DE)
Frank Stephan (National Singapore, SG)
Paul Tarau (North Texas, Denton, US)
Andrzej Tarlecki (Warsaw, PL)
Jacobo Torán (Ulm, DE)
Frits Vaandrager (Nijmegen, NL)
Jaco van de Pol (Twente, Enschede, NL)
Pierre Wolper (Liège, BE)
Zhilin Wu (Chinese Academy, Beijing, CN)
Slawomir Zadrozny (Polish Academy, Warsaw, PL)
Hans Zantema (Eindhoven Tech, NL)


Sébastien Autran (Nice)
Adrian Horia Dediu (Tarragona)
Enrico Formenti (Nice, co-chair)
Sandrine Julia (Nice)
Carlos Martín-Vide (Tarragona, co-chair)
Christophe Papazian (Nice)
Julien Provillard (Nice)
Pierre-Alain Scribot (Nice)
Bianca Truthe (Giessen)
Florentina Lilica Voicu (Tarragona)


Authors are invited to submit non-anonymized papers in English presenting original and unpublished
research. Papers should not exceed 12 single-spaced pages (including eventual appendices,
references, etc.) and should be prepared according to the standard format for Springer Verlag's LNCS
series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0).

Submissions have to be uploaded to:



A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference.

A special issue of a major journal will be later published containing peer-reviewed substantially
extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation.


The period for registration is open from July 21, 2014 to March 2, 2015. The registration form can be found at:



Paper submission: October 10, 2014 (23:59 CET)
Notification of paper acceptance or rejection: November 18, 2014
Early registration: November 25, 2014
Final version of the paper for the LNCS proceedings: November 26, 2014
Late registration: February 16, 2015
Submission to the journal special issue: June 6, 2015


florentinalilica.voicu <at> urv.cat


LATA 2015
Research Group on Mathematical Linguistics (GRLMC)
Rovira i Virgili University
Av. Catalunya, 35
43002 Tarragona, Spain

Phone: +34 977 559 543
Fax: +34 977 558 386


Nice Sophia Antipolis University
Rovira i Virgili University

Este mensaje no contiene virus ni malware porque la protección de avast! Antivirus está activa.

Concurrency mailing list
Concurrency <at> listserver.tue.nl
Francesco tiezzi | 27 Jul 08:01 2014

ACM SAC 2015: Track on Coordination Models, Languages and Applications - Second CfP

                  Coordination Models, Languages and Applications
        Special Track of the 30th ACM Symposium on Applied Computing (SAC'15)        
                                April 13 - 17, 2015
                                  Salamanca, Spain


Building on the success of the fifteenth previous editions (1998-2014), a special 
track on coordination models, languages and applications will be held at SAC 2015. 
Over the last decade, we have witnessed the emergence of models, formalisms and 
mechanisms to describe concurrent and distributed computations and systems based on 
the concept of coordination. The purpose of a coordination model is to enable the 
integration of a number of possibly heterogeneous components (processes, objects, 
agents, services) in such a way that the resulting ensemble can execute as a whole, 
forming a distributed software system with desired characteristics and functionalities. 
This is done in terms of coordination abstractions, languages, algorithms, mechanisms, 
and middleware specifically focused on the management of component interaction.

The coordination paradigm crosscuts a number of contemporary software engineering 
approaches and fields, which we aim to cross-fertilize and bring contribution to, 
including in particular: multi-agent systems, self-adaptative and self-organising 
systems, service-oriented architectures, component-based systems, and all related 
middleware platforms. 

The Special Track on Coordination Models, Languages and Applications takes a 
deliberately broad view of what constitutes coordination. Accordingly, major topics 
of interest this year will include:

   - Novel models, languages, formalisms, programming and implementation techniques
   - Coordination technologies, systems and infrastructures
   - Applications
   - Middleware platforms
   - Formal aspects (semantics, reasoning, verification)
   - Software architectures and software engineering techniques
   - Coordination of multi-agent systems, including mobile agents, intelligent agents, 
     and agent-based simulations
   - Internet, Web, and pervasive computing systems coordination
   - Languages for service description and composition
   - Models, frameworks and tools for Group Decision Making
   - All aspects related to Cooperative Information Systems (e.g. workflow management, 
   - Configuration and Architecture Description Languages
   - Self-organising, self-adaptive and nature-inspired coordination approaches
   - Relationship with other computational models such as object oriented, declarative 
     (functional, logic, constraint) programming or their extensions with coordination 
   - Coordination models and specification in Service-Oriented Architectures, Web Service 
     technologies (orchestration, choreography, etc.),Pervasive Computing and Autonomic 
   - Policy-based approaches to coordination and self-adaptation

We also welcome papers on practical systems or novel applications that are aimed at 
reaching coordination between components and services, especially if those systems and 
novel applications challenge existing ideas and models.

In previous editions, CM Special Track organisers have been inviting authors of selected 
papers for special issues in high impact journals, such as, ACM Transactions on Autonomous 
and Adaptive Systems (TAAS) and Science of Computer Programming (SCP).  

   Important Dates

     Sept 12, 2014: Paper submission 
     Nov 17, 2014: Author notification
     Dec 8, 2014: Camera-Ready Copy
     Dec 15 2014: Author Registration

   Program Co-Chairs

Mirko Viroli
    Alma Mater Studiorum - Universita' di Bologna

Jose Luis Fernandez-Marquez
    University of Geneva
Francesco Tiezzi    
    IMT Institute for Advanced Studies Lucca

   Program Committee Members

Farhad Arbab, CWI Amsterdam and Leiden University, Netherlands
Jacob Beal, BBN Technologies, USA 
Ferruccio Damiani, University of Torino, Italy
Wolfgang De Meuter, Vrije Universiteit Brussel, Belgium
Rocco De Nicola, Institute for Advanced Studies Lucca, Italy 
Simon Dobson, University of St Andrews, Scotland 
eva Kühn, Vienna University of Technology, Austria
Hung La, Rutgers University, USA 
Flemming Nielson, Technical University of Denmark
Michael O'Grady, University College Dublin, Ireland
Andrea Omicini, University of Bologna, Italy
Manuel Oriol, University of York, UK
António Porto, University of Porto, Portugal
Rosario Pugliese, University of Firenze, Italy
Alessandro Ricci, University of Bologna, Italy
Juan Antonio Rodriguez Aguilar, IIIA-CSIC, Spain
Michael Ignaz Schumacher, University of Applied Sciences, Switzerland
Marjan Sirjani, Reykjavik University, Iceland
Yasuyuki Tahara, National Institute of Informatics, Japan
Robert Tolksdorf, Freie Universitaet Berlin, Germany
Giuseppe Valetto, Drexel University, USA 
Eiko Yoneki, University of Cambridge Computer Laboratory, UK
Nobuko Yoshida, Imperial College London, UK
George Wells, Rhodes University, South Africa
Danny Weyns, Linnaeus University, Sweden
Pawel T. Wojciechowski, Poznan University of Technology, Poland


Papers accepted for the Special Track on Coordination Models, Languages and 
Applications will be published by ACM both in the SAC 2015 proceedings and in 
the Digital Library.

   Paper submission and format

All papers should represent original and previously unpublished works that 
currently are not under review in any conference or journal.

The author(s) name(s) and address(es) must NOT appear in the body of the paper,
and self-reference should be in the third person. This is to facilitate blind 
review. Only the title should be shown at the first page without the author's 

Submitted papers must be no longer than 6 pages and in the ACM two-column page
format (doc template, pdf template, latex template). It will be possible to have 
up to 2 extra pages in the proceeding at a charge of $80 per page (total 8 pages 

Paper registration is required, allowing the inclusion of the paper/poster in the
conference proceedings. An author or a proxy attending SAC MUST present the paper. 
This is a requirement for the paper/poster to be included in the ACM/IEEE digital 
library. No-show of scheduled papers and posters will result in excluding them 
from the ACM/IEEE digital library.

Submission is entirely automated via the STAR Submission System, which is available 
from the main SAC Web Site: https://www.softconf.com/d/sac2015/.

   Poster Sessions

Papers that received high reviews (that is acceptable by reviewer standards) but 
were not accepted due to space limitation can be invited for the poster session. 
Poster should be not longer than 2 pages plus 1 extra page at $80. The poster 
session procedures and details will be posted on SAC 2015 website as soon as they 
become available.

   Student research abstracts competition

Graduate students are invited to submit research abstracts (minimum of 2-page and 
maximum of 4-page) following the instructions published at SAC 2015 website. 
Submission of the same abstract to multiple tracks is not allowed.
Concurrency mailing list