[Apologies for crossposting multiple copies of this CFP.] ======================================================================= Call for Papers for the 2nd International Workshop GRAPHS AS MODELS (GaM 2016) http://gam2016.swt-bamberg.de a Satellite Event of ETAPS 2016, Eindhoven -- 02-03 April 2016 ======================================================================= === Important Dates === - Deadline for submission: 22nd January 2016 - Notification: 26th February 2016 - Final manuscript: mid/end March 2016 - Workshop: 2nd + 3rd April 2016 === Description === Graphs are used as models in all areas of computer science: examples are state space graphs, control flow graphs, syntax graphs, UML-type models of all kinds, network layouts, social networks, dependency graphs, and so forth. Once such graphical models are constructed, they can be analysed and transformed to verify their correctness within a domain, discover new properties, or produce new equivalent and/or optimised versions. Graphs as Models combines the strengths of two pre-existing workshop series: GT-VMT (Graph Transformation and Visual Modelling Techniques) and GRAPHITE (Graph Inspection and Traversal Engineering), but also solicits research from other related areas, such as Social Network Analysis. Graphs as Models’ main focus is the exchange and collaboration of researchers from different backgrounds. The workshop serves as platform to boost inter- and transdisciplinary research and foster new ideas and collaborations. Thus, besides classical research presentations, the workshop is highly geared toward numerous interactive sessions. === Topics === This workshop seeks to attract and stimulate research on the techniques for graph analysis, inspection and transformation, on an abstract level rather than in any specific domain. Thus, the concept of a graph (in its many guises) is central. Contributions should address scenarios for the use of graphs in a modelling context that potentially transcend specific settings and can be applied across domains. We welcome contributions on any of the following (non-exhaustive) list of topics: * The use of graph-based and graph-transformation-based models within various general approaches such as: - visual modelling languages (including aspects of meta modelling, grammars, and graphical parsing), - model-to-model and model-to-X transformations, - stochastic processes on graphs, and - compositional models (e.g. graphs-with-boundary, nominal graphs, string diagrams), and applications to concrete domains, including (but not restricted to): - software development (e.g., synthesis, planning, bug mitigation, repair & model driven development), - software analysis (e.g., verification, testing, static analysis, and simulation), - concurrency, - constraint based reasoning, and - social network analysis; * Algorithms on graphs (with focus on scalability and efficiency), for example - graph search optimization (including search space reduction techniques), - analysis of large graphs and graph transformation systems, - graph matching, isomorphism checking, etc., - graph properties that support efficient algorithms regarding quality properties (like real-time, safety, reliability, and energy consumption), - approaches exploiting concurrency/parallelism and dedicated hardware, and - simulation of models. * The visualization of large graphs (including the simulation of transformation systems). * New ways of applying graphs and graph transformation based techniques. * Case studies and tools. === Workshop Format === This is a one-day-and-a-half day workshop programmed as a mixture of: * Submitted paper presentations and * Fully interactive sessions. === Submissions === The workshop seeks submissions of three kinds: 1.) Full papers: We solicit papers of up to 15 pages, in the EPTCS LaTeX format, containing original results. Accepted papers will be published in EPTCS (Electronic Proceedings in Theoretical Computer Science). 2.) Work-in-progress papers: We solicit papers of up to 15 pages, in the EPTCS LaTeX format, describing ongoing research. Accepted papers will be presented at the workshop and might be selected for publication in EPTCS. 3.) Presentation abstracts: We solicit an abstract of 1-2 pages, in the EPTCS LaTeX format, describing ongoing research. Accepted abstracts will lead to a presentation at the workshop and will be included in the workshop's webpages. 4.) Informal tool demo proposals: Tool demos limited to 10 minutes. Proposals will not be reviewed, unless selection turns out to be needed. All submissions have to adhere to the EPTCS format available at http://style.eptcs.org/ All contributions have to be submitted through EasyChair at: https://easychair.org/conferences/?conf=gam2016 Details can be found on the workshop's webpage. === Chairs === - Alexander Heußner, University of Bamberg - Aleks Kissinger, Radboud University Nijmegen - Anton Wijs, Eindhoven University of Technology === Program Committee === - Paolo Bottoni, Sapienza University Rome - Dimitrios Christopoulos, Modul University Vienna - Andrew Fish, University of Brighton - Reiko Heckel, University of Leicester - Keijo Heljanko, Aalto University - Karsten Klein, University of Sidney - Christian Krause, SAP Innovation Center Potsdam - Barbara König, University of Essen-Duisburg - Leen Lambers, HPI Potsdam - Renaud Lambiotte, University of Namur - Yngve Lamo, University of Bergen - Frédéric Lang, INRIA Grenoble Rhône-Alpes - Mieke Massink, CNR-ISTI Pisa - Ugo Montanari, University of Pisa - Arend Rensink, University of Twente - Leila Ribeiro, Universidade Federal do Rio Grande do Sul - Andy Schürr, TU Darmstadt - Scott Smolka, Stony Brook University - Pawel Sobocinski, University of Southhampton - Bernhard Westfechtel, University of Bayreuth - Tim Willemse, Eindhoven Univ. of Technology === Steering Committee === - Stefan Edelkamp, University of Bremen - Frank Hermann, Carmeq GmbH - Barbara König, University of Duisburg-Essen - Juan de Lara, Universidad Autónoma de Madrid - Arend Rensink, University of Twente - Anton Wijs, TU Eindhoven [For admin and other information see: http://www.mta.ca/~cat-dist/ ]