Graph Transformations in Computer Science International Workshop, Dagstuhl Castle, Germany, January 4 - 8, 1993. Proceedings / edited by Hans J. Schneider, Hartmut Ehrig.

The research area of graph grammars and graph transformations dates back only two decades. But already methods and results from the area of graph transformation have been applied in many fields of computer science, such as formal language theory, pattern recognition and generation, compiler construc...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Schneider, Hans J. (Editor), Ehrig, Hartmut (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1994.
Edition:1st ed. 1994.
Series:Lecture Notes in Computer Science, 776
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.

MARC

LEADER 00000nam a22000005i 4500
001 b3242328
003 MWH
005 20191026153404.0
007 cr nn 008mamaa
008 121227s1994 gw | s |||| 0|eng d
020 |a 9783540483335 
024 7 |a 10.1007/3-540-57787-4  |2 doi 
035 |a (DE-He213)978-3-540-48333-5 
050 4 |a E-Book 
072 7 |a UYQP  |2 bicssc 
072 7 |a COM016000  |2 bisacsh 
072 7 |a UYQP  |2 thema 
245 1 0 |a Graph Transformations in Computer Science  |h [electronic resource] :  |b International Workshop, Dagstuhl Castle, Germany, January 4 - 8, 1993. Proceedings /  |c edited by Hans J. Schneider, Hartmut Ehrig. 
250 |a 1st ed. 1994. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 1994. 
300 |a VIII, 404 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 776 
490 1 |a Springer eBook Collection 
505 0 |a Path-controlled graph grammars for multiresolution image processing and analysis -- Syntax and semantics of hybrid database languages -- Decomposability helps for deciding logics of knowledge and belief -- Extending graph rewriting with copying -- Graph-grammar semantics of a higher-order programming language for distributed systems -- Abstract graph derivations in the double pushout approach -- Note on standard representation of graphs and graph derivations -- Jungle rewriting: An abstract description of a lazy narrowing machine -- Recognizable sets of graphs of bounded tree-width -- Canonical derivations for high-level replacement systems -- A computational model for generic graph functions -- Graphs and designing -- ESM systems and the composition of their computations -- Relational structures and their partial morphisms in view of single pushout rewriting -- Single pushout transformations of equationally defined graph structures with applications to actor systems -- Parallelism in single-pushout graph rewriting -- Semantics of full statecharts based on graph rewriting -- Contextual occurrence nets and concurrent constraint programming -- Uniform-modelling in graph grammar specifications -- Set-theoretic graph rewriting -- On relating rewriting systems and graph grammars to event structures -- Logic based structure rewriting systems -- Guaranteeing safe destructive updates through a type system with uniqueness information for graphs -- Amalgamated graph transformations and their use for specifying AGG — an algebraic graph grammar system. 
520 |a The research area of graph grammars and graph transformations dates back only two decades. But already methods and results from the area of graph transformation have been applied in many fields of computer science, such as formal language theory, pattern recognition and generation, compiler construction, software engineering, concurrent and distributed systems modelling, and database design and theory. This volume contains 24 selected and revised papers from an international seminar held in Dagstuhl, Germany, in 1993. The papers cover topics in the following areas: foundations of graph grammars and transformations; and applications of graph transformations to concurrent computing, specification and programming, and pattern generation and recognition. 
590 |a Loaded electronically. 
590 |a Electronic access restricted to members of the Holy Cross Community. 
650 0 |a Pattern recognition. 
650 0 |a Computers. 
650 0 |a Mathematical logic. 
650 0 |a Combinatorics. 
650 0 |a Software engineering. 
650 0 |a Data structures (Computer science). 
690 |a Electronic resources (E-books) 
700 1 |a Schneider, Hans J.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Ehrig, Hartmut.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 776 
830 0 |a Springer eBook Collection. 
856 4 0 |u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/3-540-57787-4  |3 Click to view e-book  |t 0 
907 |a .b32423287  |b 04-18-22  |c 02-26-20 
998 |a he  |b 02-26-20  |c m  |d @   |e -  |f eng  |g gw   |h 0  |i 1 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645) 
902 |a springer purchased ebooks 
903 |a SEB-COLL 
945 |f  - -   |g 1  |h 0  |j  - -   |k  - -   |l he   |o -  |p $0.00  |q -  |r -  |s b   |t 38  |u 0  |v 0  |w 0  |x 0  |y .i21554936  |z 02-26-20 
999 f f |i da2e81da-fad2-5f55-a088-4d2055d632ae  |s 76b12ee8-b386-5748-ac27-29a96da564d1  |t 0 
952 f f |p Online  |a College of the Holy Cross  |b Main Campus  |c E-Resources  |d Online  |t 0  |e E-Book  |h Library of Congress classification  |i Elec File