3rd Workshop On GRAPH Inspection and Traversal Engineering

(GRAPHITE 2014)

5 April 2014, Grenoble (France)

co-located with ETAPS 2014

SCOPE

The aim of GRAPHITE is to foster the convergence on research interests from several communities dealing with graph analysis in all its forms in computer science, with a particular attention to software development and analysis.

Graphs are used to represent data and processes in many application areas, and they are subjected to various computational algorithms in order to analyse them. Just restricting the attention to the analysis of software, graph analysis algorithms are used, for instance, to verify properties using model checking techniques that explore the system’s state space graph or static analysis techniques based on control flow graphs. Further application domains include games, planning, and network analysis. Very often, graph problems and their algorithmic solutions have common characteristics, independent of their application domain. The goal of this event is to gather scientists from different communities, who do research on graph analysis algorithms, such that awareness of each others’ work is increased.

TOPICS

  • Graph algorithms for software analysis, including verification, static analysis, and simulation;
  • Graph algorithms for software development, including synthesis, planning, bug mitigation and repair;
  • Graph search optimization techniques such as state space reduction techniques;
  • Graph algorithms exploiting parallel and distributed architectures, including clusters, grids and cloud platforms;
  • Graph algorithms exploiting dedicated hardware, including graphics processing units and massive storage;
  • Stochastic processes on graphs, including random walks;
  • Mining techniques for analyzing software, including process mining, code mining and state space mining;
  • Analysis of large graphs, including large state spaces, large networks, and big (graph) data.
  • Novel graph-based approaches to software development and analysis;

IMPORTANT DATES

  • Abstract submission: 31 January 2014
  • Paper submission: 3 February 2014
  • Notification: 28 February 2014
  • Pre-proceedings camera ready due: 15 March 2014
  • Conference: 5th April 2014

INVITED SPEAKER

  • Radu Mateescu (Inria Grenoble – Rhône-Alpes, France) – Walking Back and Forth in Labelled Transition Systems

Abstract: Graph exploration underlies several analysis problems defined on Labeled Transition Systems, such as model checking, equivalence checking, tau-confluence reduction, pruning of undesirable behavior, etc. This talk gives an overview of the graph exploration techniques available in the CADP verification toolbox, their instantiation in verification tools (in particular, the Evaluator 4.0 and XTL model checkers), and their applications to the analysis of LTSs.

ACCEPTED PAPERS

  • William Mansky, Dennis Griffith and Elsa Gunter. Specifying and Executing Optimizations for Parallel Programs
  • Giorgio Delzanno, Arend Rensink and Riccardo Traverso. Graph- versus Vector-Based Analysis of a Consensus Protocol
  • Roi Blanco, Paolo Boldi and Andrea Marino. Entity-Linking via Graph-Distance Minimization
  • Gijs Kant and Jaco Van De Pol. Generating and Solving Symbolic Parity Games
  • Steffen Ziegert. Graph Transformation Planning via Abstraction
  • Valerio Senni and Michele Stawowy. Backwards State-space Reduction for Planning in Dynamic Knowledge Bases
  • Maribel Fernandez, Helene Kirchner and Bruno Pinaud. Strategic portgraph rewriting: an interactive modelling and analysis framework

PROGRAM

Session 1: Welcome and Invited Talk (chair: Anton Wijs)

  • 9:15 Welcome by GRAPHITE organizers
  • 9:30 Radu Mateescu. Walking Back and Forth in Labelled Transition Systems (Invited Talk)

10:30 Coffee break

Session 2 (chair: Dragan Bosnacki)

  • 11:00 Gijs Kant and Jaco Van De Pol. Generating and Solving Symbolic Parity Games
  • 11:30 Maribel Fernandez, Helene Kirchner and Bruno Pinaud. Strategic portgraph rewriting: an interactive modelling and analysis framework
  • 12:00 Roi Blanco, Paolo Boldi and Andrea Marino. Entity-Linking via Graph-Distance Minimization

12:30 Lunch

Session 3 (chair: Alberto Lluch Lafuente)

  • 14:00 Giorgio Delzanno, Arend Rensink and Riccardo Traverso. Graph- versus Vector-Based Analysis of a Consensus Protocol
  • 14:30 William Mansky, Dennis Griffith and Elsa Gunter. Specifying and Executing Optimizations for Parallel Programs
  • 15:00 Valerio Senni and Michele Stawowy. Backwards State-space Reduction for Planning in Dynamic Knowledge Bases
  • 15:30 Steffen Ziegert. Graph Transformation Planning via Abstraction

ORGANIZERS

PROGRAM COMMITTEE

  • Klemens Böhm (Karlsruhe Institute of Technology, Germany)
  • Pierluigi Crescenzi (University of Florence, Italy)
  • Keijo Heljanko (Aalto University, Finland)
  • Martin Hofmann (LMU Munich, Germany)
  • Jeroen Ketema (Imperial College London, UK)
  • Barbara König (University of Duisburg-Essen, Germany)
  • Stefan Leue (University of Konstanz, Germany)
  • David Lo (Singapore Management University, Singapore)
  • Michele Loreti (University of Florence, Italy)
  • Mila Majster-Cederbaum (LMU Munich, Germany)
  • Mieke Massink (CNR-ISTI Pisa, Italy)
  • Dave Parker (University of Birmingham, UK)
  • Arend Rensink (University of Twente, The Netherlands)
  • Andrey Rybalchenko (Microsoft Research Cambridge, UK and TU Munich, Germany)
  • Gwen Salaün (Grenoble INP, Inria, France)
  • Valerio Senni (IMT Institute of Advanced Studies Lucca, Italy)
  • Sebastiano Vigna (University of Milan, Italy)
  • Willem Visser (University of Stellenbosch, South Africa)

SUBMISSION

Submitted papers should contain original work which has not been submitted or accepted for publication elsewhere. Submissions should adhere to the EPTCS format and should be no longer than 12 pages.

All accepted papers will be included in the workshop pre-proceedings.

We plan to publish all papers accepted papers in EPTCS post-proceedings after the conference.

Papers are to be submitted through EasyChair at

https://www.easychair.org/conferences/?conf=graphite2014

We also plan to organize a special issue of selected papers to be published on a in a highly-reputed Elsevier journal.

PREVIOUS EVENTS

CONTACT

graphite2014@easychair.org

Leave a Reply

Your email address will not be published. Required fields are marked *