The topic of the GRAPHITE workshop is graph analysis in all its forms in computer science. Graphs are used to represent data in many application areas, and they are subjected to various computational algorithms in order to acquire the desired information. These graph algorithms tend to have common characteristics, such as duplicate detection to guarantee their termination, independent of their application domain. Over the past few years, it has been shown that the scalability of such algorithms can be dramatically improved by using, e.g., external memory, by exploiting parallel architectures, such as clusters, multi-core CPUs, and graphics processing units, and by using heuristics to guide the search. Novel techniques to further scale graph search algorithms, and new applications of graph search are within the scope of this workshop. Another topic of interest of the event is more related to the structural properties of graphs: which kind of graph characteristics are relevant for a particular application area, and how can these be measured? Finally, any novel way of using graphs for a particular application area is on topic. The goal of this event is to gather scientists from different communities, such as model checking, artificial intelligence planning, game playing, and algorithm engineering, who do research on graph search algorithms, such that awareness of each others' work is increased.

• Currently, there is a call for (short) papers (7-15 pages EPTCS style) for the post-proceedings of the workshop. Deadline July 21, 2013!

CONSTRUCTION OF CORRECT SYSTEMS
• 10.00-10.30 Gwen Salaün (INRIA Rhône-Alpes, France)
  Verification of Contract-based Communicating Systems
• 10.30-11.00 Enrico Tronci (Università di Roma "La Sapienza", Italy)
  Control Software Synthesis from Systems Level Formal Specifications

SEARCH AND REACHABILITY
• 11.30-12.00 Nils Semmelrock & Mila Majster-Cederbaum (Unversität Mannheim, Germany)
  Reachability on Cooperating Systems with Architectural Constraints is PSPACE-Complete
• 12-00-12.30 Stefan Edelkamp & Christoph Greulich (University of Bremen, Germany)
  Graph Matching and Shortest Path Search for Multi-Modal Public Transportation

STATE SPACE REDUCTION
• 14.00-14.30 Arend Rensink (University of Twente, The Netherlands)
  Recipes for Reduced State Spaces
• 14.30-15.00 Alberto Lluch-Lafuente (IMT Lucca, Italy)
  State Space c-Reductions of Concurrent Systems in Rewriting Logic
• 15.00-15.30 Anton Wijs (Eindhoven University of Technology, The Netherlands)
  Sequential and Distributed On-the-fly Computation of Weak Tau-Confluence

GPU COMPUTING
• 16.00-16.30 Jeroen Ketema (Imperial College London, UK)
  GPUVerify: A Verifier for GPU Kernels
• 16.30-17.00 Dragan Bošnački (Eindhoven University of Technology, The Netherlands)
  Parallel Algorithms for Reconstruction of Interaction Graphs from Perturbation Experiments