From mboxrd@z Thu Jan 1 00:00:00 1970 X-Sympa-To: caml-list@inria.fr Received: from mail4-relais-sop.national.inria.fr (mail4-relais-sop.national.inria.fr [192.134.164.105]) by walapai.inria.fr (8.13.6/8.13.6) with ESMTP id q345MtOP020212 for ; Wed, 4 Apr 2012 07:22:55 +0200 X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: AocDAN7Ze0+BWB4Fh2dsb2JhbABFArg4AQEBCgsQFieCCgEFHRsbJREdDwwKDwkDAgECATcOEwYCAQGIBQu6EosNgheDMASVY4ERhF+NKYFSAhc X-IronPort-AV: E=Sophos;i="4.75,366,1330902000"; d="scan'208";a="138980350" Received: from mx1.imag.fr (HELO shiva.imag.fr) ([129.88.30.5]) by mail4-smtp-sop.national.inria.fr with ESMTP; 04 Apr 2012 07:22:49 +0200 Received: from globule.imag.fr (globule.imag.fr [129.88.34.238]) by shiva.imag.fr (8.13.8/8.13.8) with ESMTP id q345GgVN014940 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=NO); Wed, 4 Apr 2012 07:16:42 +0200 Received: from [129.88.58.140] (echahed-vpn.imag.fr [129.88.58.140]) (authenticated bits=0) by globule.imag.fr (8.13.8/8.13.8) with ESMTP id q345Os1h009605 (version=TLSv1/SSLv3 cipher=DHE-RSA-AES256-SHA bits=256 verify=NO); Wed, 4 Apr 2012 07:25:11 +0200 Message-ID: <4F7BDA75.9040404@imag.fr> Date: Wed, 04 Apr 2012 07:21:57 +0200 From: Rachid Echahed User-Agent: Mozilla/5.0 (Windows NT 5.1; rv:11.0) Gecko/20120327 Thunderbird/11.0.1 MIME-Version: 1.0 To: Rachid.Echahed@imag.fr References: <4E85734A.9040501@imag.fr> <4F105058.5010104@imag.fr> In-Reply-To: <4F105058.5010104@imag.fr> Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 7bit X-Greylist: Sender IP whitelisted, not delayed by milter-greylist-4.0.1 (shiva.imag.fr [129.88.30.5]); Wed, 04 Apr 2012 07:16:42 +0200 (CEST) X-IMAG-MailScanner-Information: Please contact MI2S MIM for more information X-MailScanner-ID: q345GgVN014940 X-IMAG-MailScanner: Found to be clean X-IMAG-MailScanner-SpamCheck: X-IMAG-MailScanner-From: rachid.echahed@imag.fr MailScanner-NULL-Check: 1334121406.02346@F89qCL/0fdHi3HQej4P1AQ X-Validation-by: rachid.echahed@imag.fr Subject: [Caml-list] CFP: Graph Computation Models (GCM2012) ----------------------------------------------------------------------- CALL FOR PAPERS GCM 2012 Fourth International Workshop on Graph Computation Models Bremen, Germany, September 29th, 2012 http://gcm2012.imag.fr/ Part of ICGT2012 http://www.informatik.uni-bremen.de/icgt2012/ Full versions of best papers will be included in an issue of the the international journal of the "Electronic Communications of the EASST" -------------------------------------------------------------------------- Aims The aim of the International Workshop GCM2012 is to bring together researchers interested in all aspects of computation models based on graphs and graph transformation techniques. It promotes the cross-fertilizing exchange of ideas and experiences among researchers and students from the different communities interested in the foundations, applications, and implementations of graph computation models and related areas. GCM2012 is a one-day satellite event of ICGT 2012, which will take place in Bremen, Germany, from 24 to 29 of September 2012. Previous editions of GCM series were held in Natal, Brazil (GCM 2006), in Leicester, UK (GCM 2008) and in Enschede, The Netherlands (GCM 2010). ----------------------------------------------------------------------- Topics of Interest GCM 2012 solicits papers in all areas of Graph Computation Models including but not limited to: Foundations : Models of graph transformation; Parallel, concurrent, and distributed; graph transformations; Term graph rewriting; Logics on graphs and graph transformations; Formal graph languages Analysis and verification of graph transformation systems; Foundations of programming languages Applications : Software architecture; Software validation; Software evolution; Visual programming; Security models; Implementation of programming languages; Rule-based systems; Workflow and business processes; Model-driven engineering; Service-oriented applications; Bioinformatics and system biology; Quantum computing, Case-studies ----------------------------------------------------------------------- Important Dates Abstract Submission : July 8th, 2012 Paper Submission : July 15th, 2012 Acceptance Notification: August 13th, 2012 Preliminary Proceedings: September 2nd, 2012 Workshop : September 29th, 2012 ----------------------------------------------------------------------- Submissions and Publication Authors are invited to submit either regular papers (up to 15 pages), or position papers, system descriptions, work in progress, extended abstracts (5-7 pages), via the EasyChair system, at URL https://www.easychair.org/account/signin.cgi?conf=gcm2012 Submissions should be in PDF format, using Lecture Notes in Computer Science (LNCS) style. Preliminary proceedings will be distributed at the workshop. Selected authors will be invited to submit a full version of their papers after the workshop. These submissions will pass through a second round of reviewing and accepted contributions are to be published as a special issue of the international journal of the "Electronic Communications of the EASST". ----------------------------------------------------------------------- Program Committee * Paolo Baldan, University of Padova, Italy * Franck Drewes, Umea University, Sweden * Rachid Echahed (cochair), LIG Lab., Grenoble, France * Stefan Gruner, University of Pretoria, South Africa * Annegret Habel (cochair), University of Oldenburg, Germany * Dirk Janssens, University of Antwerp, Belgium * Hans-Joerg Kreowski, University of Bremen, Germany * Pascale Le Gall, University of Evry-Val d'Essonne, France * Mohamed Mosbah (cochair), University of Bordeaux, France * Detlef Plump, University of York, UK ----------------------------------------------------------------------- Organizers and contact * Annegret Habel, University of Oldenburg, Germany * Mohamed Mosbah, University of Bordeaux, France * Rachid Echahed, LIG Lab., Grenoble, France You can contact GCM 2012 organizers via gcm2012@imag.fr -----------------------------------------------------------------------