Barbara König  Home/Search
Context Related
| flop.informatik.tumue...fsttcs00.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wwwbrauer.informatik.tumue...all (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type graph is invariant under reduction, but still contains meaningful behaviour information. We present conditions, a type system for graph rewriting should satisfy, and a methodology for proving these conditions. In two case studies it is shown how to incorporate existing type systems (for the polyadic -... (Update)
Context of citations to this paper: More
...type, then we can be sure that the property X holds. H . T Y (T ) X(H) correctness) 1) Note that in the short version of this paper [11], we have omitted the predicate Y , since it is always true for the two examples presented there. But for some examples (see section 4.3)...
.... complete pre xes [13] 1 the rich literature on GTSs does not contain many contributions to the static analysis of such systems (see [11, 12]) In this paper we present an original analysis technique for a class of (hyper) graph transformation systems, which, given a system and...
Cited by: More
Approximating the Behaviour of Graph Transformation Systems - Baldan, König (2002) (Correct)
Towards Unfolding-Based Verification for Graph.. - Baldan, Corradini, König (2003) (Correct)
Verifying Finite-State Graph Grammars: an Unfolding-Based.. - Baldan, Corradini, König (Correct)
Active bibliography (related documents): More All
2.2: A General Framework for Types in Graph Rewriting - König (2000) (Correct)
0.8: A Graph Rewriting Semantics for the Polyadic π-Calculus.. - König (2000) (Correct)
0.5: Hypergraph Construction and Its Application to the Compositional.. - König (2000) (Correct)
Similar documents based on text: More All
0.1: Generating Type Systems for Process Graphs - König (1999) (Correct)
0.1: Dr. Luise Unger - Fb Mathematik Fernuniversitt (2000) (Correct)
0.0: A Graph Rewriting Semantics for the Polyadic pi-Calculus - König (2000) (Correct)
Related documents from co-citation: More All
8: Handbook of Graph Grammars and Computing by Graph Transformation (context) - Ehrig, Kreowski et al. - 1999
5: Fundamenta Informaticae (context) - Corradini, Montanari et al. - 1996
4: Model Checking Using Net Unfoldings (context) - Esparza - 1994
BibTeX entry: (Update)
Barbara Konig. A general framework for types in graph rewriting. Technical Report TUM-I0014, Technische Universitat Munchen, 2000. http://citeseer.ist.psu.edu/article/onig00general.html More
@article{ nig00general,
author = "Barbara K{\"o}nig",
title = "A General Framework for Types in Graph Rewriting",
journal = "Lecture Notes in Computer Science",
volume = "1974",
pages = "373--??",
year = "2000",
url = "citeseer.ist.psu.edu/article/onig00general.html" }
Citations (may not include all citations):149 calculus: a tutorial (context) - Milner - 1993
146 Typing and subtyping for mobile processes - Pierce, Sangiorgi - 1993
127 Information and Computation (context) - Walker, the - 1995
111 Handbook of Graph Grammars and Computing by Graph Transforma.. (context) - Ehrig, Kreowski et al. - 1999
109 Interaction nets (context) - Lafont - 1990
91 Rewriting logic as a semantic framework for concurrency: A p.. - Meseguer - 1996
89 Calculi for interaction - Milner - 1996
67 Composing processes - Honda - 1996
43 Fundamenta Informaticae (context) - Corradini, Montanari et al. - 1996
43 Hyperedge Replacement: Grammars and Languages (context) - Habel - 1992
42 Deriving bisimulation congruences for reactive systems - Leifer, Milner - 2000
22 Graph notation for concurrent combinators - Yoshida - 1994
13 Theoretical Computer Science (context) - Gardner, calculi - 1998
11 Comparing logics for rewriting: Rewriting logic (context) - Gadducci, Montanari - 2000
10 Introduction to the algebraic theory of graphs (context) - Ehrig - 1979
8 Generating type systems for process graphs - onig - 1999
6 Hypergraph construction and its application to the compositi.. - onig - 2000
6 A general framework for types in graph rewriting - onig - 2000
3 A graph rewriting semantics for the polyadic pi-calculus (context) - onig - 2000
2 Featherweight Java: A core calculus for Java and GJ (context) - Igarashi, Pierce et al. - 1999
2 available in Springer Distinguished Dissertation Series (context) - Hasegawa, Sharing et al. - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://wwwbrauer.informatik.tu-muenchen.de/gruppen/theorie/publications/all.html): More
Analysing Input/Output-Capabilities of Mobile Processes with a.. - König (Correct)
New Worst-Case Upper Bounds for MAX-2-SAT with.. - Gramm, Hirsch.. (2000) (Correct)
A Graph Rewriting Semantics for the Polyadic π-Calculus.. - König (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC