Sciweavers

GG
2010
Springer
13 years 9 months ago
Declarative Mesh Subdivision Using Topological Rewriting in MGS
Mesh subdivision algorithms are usually specified informally using graphical schemes defining local mesh refinements. These algorithms are then implemented efficiently in an impera...
Antoine Spicher, Olivier Michel, Jean-Louis Giavit...
GG
2010
Springer
13 years 10 months ago
Formal Analysis of Functional Behaviour for Model Transformations Based on Triple Graph Grammars
Abstract. Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already cruc...
Frank Hermann, Hartmut Ehrig, Fernando Orejas, Ulr...
GG
2010
Springer
13 years 11 months ago
A False History of True Concurrency: From Petri to Tools
I briefly review the history of the unfolding approach to model checking. Carl Adam Petri passed away on July 2, 2010. I learnt about his death three days later, a few hours after ...
Javier Esparza
GG
2010
Springer
13 years 11 months ago
Verification of Graph Transformation Systems with Context-Free Specifications
We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are speci...
Barbara König, Javier Esparza
GG
2010
Springer
14 years 16 days ago
A Component Concept for Typed Graphs with Inheritance and Containment Structures
Model-driven development (MDD) has become a promising trend in software engineering. The model-driven development of highly complex software systems may lead to large models which ...
Stefan Jurack, Gabriele Taentzer
GG
2010
Springer
14 years 16 days ago
Multi-Amalgamation in Adhesive Categories
Abstract. Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations....
Ulrike Golas, Hartmut Ehrig, Annegret Habel
GG
2010
Springer
14 years 16 days ago
On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars
In recent years, a research thread focused on the use of the unfolding semantics for verification purposes. This started with a paper by McMillan, which devises an algorithm for co...
Paolo Baldan, Alessandro Bruni, Andrea Corradini, ...
GG
2010
Springer
14 years 16 days ago
A Hoare Calculus for Graph Programs
el of abstraction). Refereed Conference and Workshop Papers
Christopher M. Poskitt, Detlef Plump
GG
2010
Springer
14 years 16 days ago
Local Confluence for Rules with Nested Application Conditions
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
Hartmut Ehrig, Annegret Habel, Leen Lambers, Ferna...