LISTSERV mailing list manager LISTSERV 16.0

Help for SOCNET Archives


SOCNET Archives

SOCNET Archives


SOCNET@LISTS.UFL.EDU


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

SOCNET Home

SOCNET Home

SOCNET  December 2016

SOCNET December 2016

Subject:

CfP for the 3rd International Workshop GRAPHS AS MODELS (GaM 2017)

From:

Timo Kehrer <[log in to unmask]>

Reply-To:

Timo Kehrer <[log in to unmask]>

Date:

Thu, 29 Dec 2016 11:11:10 +0100

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (197 lines)

*****  To join INSNA, visit http://www.insna.org  *****

[Apologies for crossposting multiple copies of this CfP.]


=======================================================================
Call for Papers for the 3rd International Workshop


GRAPHS AS MODELS (GaM 2017)

http://www.dcs.gla.ac.uk/gam2017


a Satellite Event of ETAPS 2017, Uppsala -- April 22-29, 2017
=======================================================================


=== Important Dates ===

- Abstract Submission: February 3, 2017
- Paper Submission: February 10, 2017
- Author Notification: March 10, 2017
- Final Version Due: April 7, 2017
- Workshop: April 22 and 23, 2017


=== 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 four 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=gam2017

=== Special Issue in Elsevier SCP ===

Authors of selected papers will be invited to submit an extended version
of their paper to a special issue in the Elsevier journal on Science of
Computer Programming (SCP) after the workshop.

=== Chairs ===

- Timo Kehrer, Humboldt-University Berlin
- Alice Miller, University of Glasgow

=== Program Committee ===

- Luciano Baresi, Politecnico di Milano
- Paolo Bottoni, Sapienza University Rome
- Dimitrios Christopoulos, Modul University Vienna
- Andrea Corradini, University of Pisa
- Stefan Edelkamp, University of Bremen
- Andrew Fish, University of Brighton
- Reiko Heckel, University of Leicester
- Keijo Heljanko, Aalto University
- Barbara König, University of Essen-Duisburg
- Christian Krause, SAP Innovation Center Potsdam
- Leen Lambers, Hasso-Plattner-Institut, Universität Potsdam
- Renaud Lambiotte, University of Namur
- Yngve Lamo, University of Bergen
- Frédéric Lang, INRIA Grenoble Rhône-Alpes
- Juan de Lara, Universidad Autonoma de Madrid
- Mieke Massink, CNR-ISTI Pisa
- Ugo Montanari, University of Pisa
- Gethin Norman, University of Glasgow
- Julia Padberg, HAW Hamburg
- Detlef Plump, University of York
- Arend Rensink, University of Twente
- Leila Ribeiro, Universidade Federal do Rio Grande do Sul
- Andy Schürr, TU Darmstadt
- Scott Smolka, Stony Brook University
- Daniel Strüber, University of Koblenz and Landau
- Bernhard Westfechtel, University of Bayreuth
- Anton Wijs, Eindhoven University of Technology
- Tim Willemse, Eindhoven University 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, Eindhoven University of Technology

_____________________________________________________________________
SOCNET is a service of INSNA, the professional association for social
network researchers (http://www.insna.org). To unsubscribe, send
an email message to [log in to unmask] containing the line
UNSUBSCRIBE SOCNET in the body of the message.

Top of Message | Previous Page | Permalink

Advanced Options


Options

Log In

Log In

Get Password

Get Password


Search Archives

Search Archives


Subscribe or Unsubscribe

Subscribe or Unsubscribe


Archives

December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008, Week 62
July 2008
June 2008
May 2008
April 2008
March 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
December 2006
November 2006
October 2006
September 2006
August 2006
July 2006
June 2006
May 2006
April 2006
March 2006
February 2006
January 2006
December 2005
November 2005
October 2005
September 2005
August 2005
July 2005
June 2005
May 2005
April 2005
March 2005
February 2005
January 2005
December 2004
November 2004
October 2004
September 2004
August 2004
July 2004
June 2004
May 2004
April 2004
March 2004
February 2004
January 2004
December 2003
November 2003
October 2003
September 2003
August 2003
July 2003
June 2003
May 2003
April 2003
March 2003
February 2003
January 2003
December 2002
November 2002
October 2002
September 2002
August 2002
July 2002
June 2002
May 2002
April 2002
March 2002
February 2002
January 2002
December 2001
November 2001
October 2001
September 2001
August 2001
July 2001
June 2001
May 2001

ATOM RSS1 RSS2



LISTS.UFL.EDU

CataList Email List Search Powered by the LISTSERV Email List Manager