19th International Workshop on Algebraic Development Techniques

Pisa, Italy, June 13-16, 2008

Home page: http://www.di.unipi.it/wadt2008

WADT 2008 Accepted Abstracts

Invited Speakers
Egon Börger
Semantics of business process modelling notations

Abstract: We use Abstract State Machines to develop an extensible semantical framework for business process modeling notations. The approach is illustrated by defining a high-level interpreter for business process diagrams written in the OMG standard BPMN. We show, by presenting various solutions of the so-called OR-join problem, how ASM models for BPMN diagrams can be used for their accurate analysis.

This is joint work with B. Thalheim and part of the Humboldt Research Award project, hosted by the Chair for Information Systems Engineering at the Computer Science Department of the University of Kiel/Germany.

Luca Cardelli
Molecules as Automata

Abstract: Chemical and biochemical systems are described as collectives of interacting stochastic automata: each automaton represents a molecule that undergoes state transitions. This framework constitutes an artificial biochemistry, where automata interact by the equivalent of the law of mass action. We analyze systems and networks, both by stochastic simulation and by ordinary differential equations, and relate the two approaches.

Stephen Gilmore
Service-level agreements for service-oriented computing

Abstract: Service-oriented computing is dynamic. There may be many possible service instances available for binding, leading to uncertainty about where service requests will execute. We present a novel Markovian process calculus which allows the formal expression of uncertainty about binding as found in service-oriented computing. We show how to compute meaningful quantitative information about the quality of service provided in such a setting. These numerical results can be used to allow the expression of accurate service-level agreements about service-oriented computing.

Selected Abstracts
Farhad Arbab, Roberto Bruni, Dave Clarke, Ivan Lanese and Ugo Montanari
Tiles for Reo
Stefano Bistarelli and Francesco Santini
C-semiring Frameworks for MST and ST problems
Filippo Bonchi, Maria Grazia Buscemi and Ugo Montanari
Symbolic semantics for cc-pi: an algebraic view
Vincenzo Ciancia and Fabio Gadducci
A Stone-type duality for nominal sets
Mihai Codescu and Till Mossakowski
Generalized theoroidal institution comorphisms
Andrea Corradini and Reiko Heckel
Towards A Spatial-Temporal Logic for Graph Transformation
Pietro Di Gianantonio, Furio Honsell and Marina Lenisa
Parametric Contexts and Finitely Branching Bisimilarities for Process Calculi
Cezara Dragoi and Gheorghe Stefanescu
On spatio-temporal logics for the verification of structured interactive programs with registers and voices
Chucky Ellison, Traian Serbanuta and Grigore Rosu
A Rewriting Logic Approach to Type Inference
Luciana Foss, Leila Ribeiro and Andrea Corradini
Graph Transformation Modules for the Specification of Reactive Systems
Fabio Gadducci
A term-graph syntax for algebras over multisets
Angelo Gargantini, Elvinia Riccobene and Patrizia Scandurra
Integrating formal methods with model-driven development techniques
Karl Gmeiner and Bernhard Gramlich
Transformations of Conditional Rewrite Systems Revisited
Mark Hills and Grigore Rosu
Towards a Module System for K
Temesghen Kahsai and Markus Roggenbach
Refinement notions for CSP-CASL
Christian Koehler, Farhad Arbab and Erik de Vink
On Hierarchical Reconfiguration of Reo Connectors
Barbara Kordy
A Rewrite Approach for Pattern Containment
Hans-Joerg Kreowski and Sabine Kuske
Autonomous Units and Their Semantics -- The Concurrent Case
Pierre Lescanne and Dragisa Zunic
Rewriting diagrams for computing and interpreting classical logic
Dominik Luecke and Till Mossakowski
Heterogeneous Model Finding with Hets
Grzegorz Marczyn'ski
Architectures as Layered Graphs of Constructions
Luis Monteiro
A coalgebraic characterization of behaviours in the linear time - branching time spectrum
Till Mossakowski and Markus Roggenbach
An institution for processes and data
Julia Padberg, Kathrin Hoffmann and Hartmut Ehrig
Modeling Data-Dependent Workflows in Mobile Ad-hoc Networks using High-Level Nets
Andrei Popescu and Grigore Rosu
Term Logic
Adrian Riesco, Alberto Verdejo, Rafael Caballero and Narciso Marti-Oliet
A declarative debugger for Maude
Donald Sannella and Andrzej Tarlecki
Observability concepts in abstract data type specification, 30 years later
Kristina Sojakova and Florian Rabe
Translating Dependently-Typed Logic to First-Order Logic
Andrzej Tarlecki
Distributed Specifications in Heterogeneous Logical Environments
Vasco T. Vasconcelos, Isabel Nunes and Antónia Lopes.
Monitoring Java Code Using conGu
Martin Wirsing, Artur Boronat, Alexander Knapp and Jose' Meseguer
What is a Multi-Modelling Language?
Uwe Wolter and Zinovy Diskin
The Van-Kampen Square in view of the Grothendieck construction
Artur Zawlocki
A Compositional Approach to Specification of Concurrent Systems
last modified: 2008-4-27