Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
26
views
23
references
Top references
cited by
3
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,842
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Abstracting Complex Data Structures by Hyperedge Replacement
other
Author(s):
Stefan Rieger
,
Thomas Noll
Publication date
(Print):
2008
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Big Data Privacy
Most cited references
23
Record
: found
Abstract
: not found
Article
: not found
Parametric shape analysis via 3-valued logic
Mooly Sagiv
,
Thomas Reps
,
Reinhard Wilhelm
(2002)
0
comments
Cited
107
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
HYPEREDGE REPLACEMENT GRAPH GRAMMARS
F. Drewes
,
H.-J. Kreowski
,
A HABEL
(1997)
0
comments
Cited
25
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Separation and information hiding
Peter O'Hearn
,
Hongseok Yang
,
John Reynolds
(2004)
0
comments
Cited
19
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Pages
: 69-83
DOI:
10.1007/978-3-540-87405-8_6
SO-VID:
4d91d38f-81f2-4584-9ed4-b76160ff966b
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Towards an Algebraic Theory of Bidirectional Transformations
pp. 18
Discovery, Verification and Conformance of Workflows with Cancellation
pp. 38
The AUTOSAR Way of Model-Based Engineering of Automotive Systems
pp. 39
An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars
pp. 54
Labelled (Hyper)Graphs, Negotiations and the Naming Problem
pp. 69
Abstracting Complex Data Structures by Hyperedge Replacement
pp. 84
Inductively Sequential Term-Graph Rewrite Systems
pp. 99
Mobile Agents Implementing Local Computations in Graphs
pp. 115
A Decentralized Implementation of Mobile Ambients
pp. 131
Network Applications of Graph Bisimulation
pp. 147
Graph Transformation for Topology Modelling
pp. 162
Embedding and Confluence of Graph Transformations with Negative Application Conditions
pp. 178
Formal Analysis of Model Transformations Based on Triple Graph Rules with Kernels
pp. 194
Semantical Correctness and Completeness of Model Transformations Using Graph and Rule Transformation
pp. 211
High-Level Programs and Program Conditions
pp. 226
Parallel and Sequential Independence for Borrowed Contexts
pp. 242
Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts
pp. 257
Open Petri Nets: Non-deterministic Processes and Compositionality
pp. 274
Attributed Graph Constraints
pp. 289
Resolution-Like Theorem Proving for High-Level Conditions
pp. 305
Towards the Verification of Attributed Graph Transformation Systems
pp. 321
A Modal-Logic Based Graph Abstraction
pp. 336
On the Recognizability of Arrow and Graph Languages
pp. 351
Graph Multiset Transformation as a Framework for Massively Parallel Computation
pp. 366
Pullback Grammars Are Context-Free
pp. 379
On Switching to H-Free Graphs
pp. 396
A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
pp. 411
15 Years of Triple Graph Grammars
pp. 426
Pattern-Based Model-to-Model Transformation
pp. 442
Adaptive Star Grammars for Graph Models
pp. 458
Tutorial Introduction to Graph Transformation
pp. 460
Workshop on Graph Computation Models
pp. 463
Graph-Based Tools: The Contest
pp. 467
Workshop on Petri Nets and Graph Transformations
pp. 470
Summary of the Workshop on Natural Computing and Graph Transformations
pp. 473
ICGT 2008 Doctoral Symposium
pp. 475
Verification of Architectural Refactorings: Rule Extraction and Tool Support
pp. 478
Abstract Semantics by Observable Contexts
pp. 481
Triple Graph Grammars and OCL for Validating System Behavior
pp. 484
From Separation Logic to Hyperedge Replacement and Back
pp. 487
Security, Cryptography and Directed Bigraphs
pp. 490
Modelling Clustering of Sensor Networks with Synchronised Hyperedge Replacement
pp. 493
Grammar Morphisms and Weakly Adhesive Categories
pp. 496
Process Construction and Analysis for Workflows Modelled by Adhesive HLR Systems with Application Conditions
pp. 499
Towards a Two Layered Verification Approach for Compiled Graph Transformation
pp. 502
Model-Based Analysis of Network Reconfigurations Using Graph Transformation Systems
pp. 505
Service Extraction from Legacy Systems
pp. 508
Development of Correct Graph Transformation Systems
pp. 511
Graph Transformation for the Semantic Web: Queries and Inference Rules
pp. 514
Using a Triple Graph Grammar for State Machine Implementations
pp. 517
Model-Driven Development of Model Transformations
pp. 520
Transformation-Based Operationalization of Graph Languages
Similar content
3,842
How to Sell Hyperedges: The Hypermatching Assignment Problem
Authors:
Marek Cygan
,
Fabrizio Grandoni
,
Monaldo Mastrolilli
The complexity of graph languages generated by hyperedge replacement
Authors:
Clemens Lautemann
,
C. Lautemann
Tree automata, tree decomposition and hyperedge replacement
Authors:
Clemens Lautemann
See all similar
Cited by
3
A Local Greibach Normal Form for Hyperedge Replacement Grammars
Authors:
Christina Jansen
,
Jonathan Heinen
,
Joost-Pieter Katoen
…
Verification of Graph Transformation Systems with Context-Free Specifications
Authors:
Barbara König
,
Javier Esparza
Juggrnaut: using graph grammars for abstracting unbounded heap structures
Authors:
Christina Jansen
,
Joost-Pieter Katoen
,
Jonathan Heinen
…
See all cited by