Nils Klarlund, et al.  Home/Search
Context Related
| daimi.au.dk/PB/469/PB469.ps.gz brics.dk/mona/papers/graph...article.ps 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: daimi.aau.dk/DAIMI/PBlist (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) Nils Klarlund ? & Michael I. Schwartzbach ?? Aarhus University, Department of Computer Science, Ny Munkegade, DK-8000 Arhus, Denmark fklarlund,misg@daimi.aau.dk Abstract. We give examples to show that not even c-edNCE, the most general known notion of context-free graph grammar, is suited for the specification of some common data structures. To overcome this problem, we use monadic second-order logic and introduce edge constraints as a new means of specifying a large class of graph... (Update)
Cited by: More
On the Boolean Algebra of Shape Analysis Constraints - Kuncak, Rinard (2003) (Correct)
On Role Logic - Kuncak, Rinard (2003) (Correct)
Similar documents (at the sentence level):
70.6%: Graphs and Decidable Transductions based on Edge Constraints - Klarlund, al. (1994) (Correct)
Active bibliography (related documents): More All
0.8: Graphs and Decidable Transductions based on Edge.. - Klarlund, Schwartzbach (1994) (Correct)
0.0: Oracles and Quantifiers - Makowsky, Pnueli (1994) (Correct)
0.0: Attribute Grammars and Monadic Second Order Logic - Bloem (1996) (Correct)
Similar documents based on text: More All
0.2: Verification of Pointers - Klarlund, Schwartzbach (Correct)
0.2: Graph Types - Klarlund, Schwartzbach (1993) (Correct)
0.1: MONA: Monadic Second-Order Logic in Practice - Henriksen, Jensen, Jørgensen.. (1995) (Correct)
Related documents from co-citation: More All
19: Parametric shape analysis via 3valued logic - Sagiv, Reps et al. - 1999
16: Nils Klarlund and Michael (context) - Klarlund, Graph et al. - 1993
13: Shape types - Fradet, Le Metayer - 1997
BibTeX entry: (Update)
N. Klarlund and M. Schwartzbach, Graphs and decidable transductions based on edge constraints, in Proc. Trees in Algebra and Programming - CAAP'94, Springer Verlag, LNCS 787, pp. 187-201, 1994. http://citeseer.ist.psu.edu/article/klarlund94graphs.html More
@inproceedings{ klarlund94graphs,
author = "Nils Klarlund and Michael I. Schwartzbach",
title = "Graphs and Decidable Transductions Based on Edge Constraints (Extended Abstract)",
booktitle = "Colloquium on Trees in Algebra and Programming",
pages = "187-201",
year = "1994",
url = "citeseer.ist.psu.edu/article/klarlund94graphs.html" }
Citations (may not include all citations):104 Graph rewriting: an algebraic and logic approach (context) - Courcelle - 1990
71 The monadic second-order logic of graphs (context) - Courcelle - 1990
46 Graph types - Klarlund, Schwartzbach - 1993
33 Monadic second-order definable graph transductions (context) - Courcelle - 1992
16 A simple method for undecidability proofs and some applicati.. (context) - Rabin - 1965
3 A characterizarion of context-free NCE graph languages by mo.. (context) - Engelfriet - 1990
3 Invariants as data types (context) - Klarlund, Schwartzbach - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.daimi.aau.dk/DAIMI/PB-list.html): More
Cryptanalysis of LOKI 91 - Knudsen (1993) (Correct)
AVL Trees with Relaxed Balance - Larsen (1992) (Correct)
Computer Aided Verification of Lamport's Fast Mutual.. - Jørgensen, Kristensen (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