Filters








3,262 Hits in 3.7 sec

Unfolding Symbolic Attributed Graph Grammars [chapter]

Maryam Ghaffari Saadat, Reiko Heckel, Fernando Orejas
<span title="">2020</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We develop a theory of unfolding for attributed graph grammars where attribution is represented symbolically, via logical constraints.  ...  However, the established concurrent semantics of graph grammars by unfolding does not cover attributed grammars.  ...  Attributed Occurrence Grammars In this and the following section we lift the theory of occurrence grammars and unfolding from typed graph grammars to lazy typed symbolic attributed ones.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-51372-6_5">doi:10.1007/978-3-030-51372-6_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pkd62ye2y5habosnl7tfg47qru">fatcat:pkd62ye2y5habosnl7tfg47qru</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200905160040/https://link.springer.com/content/pdf/10.1007%2F978-3-030-51372-6_5.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0a/bf/0abf63957eb1f6a5b2a8710663babc4fd7b72afe.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-51372-6_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Representation and reasoning with attributive descriptions [chapter]

Bernhard Nebel, Gert Smolka
<span title="">1990</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
This paper surveys terminological representation languages and feature-based unification grammars pointing out the similarities and differences between these two families of attributive description formalisms  ...  Suppose "U(S, G)" is the relation between strings of symbols and feature graphs specified by some grammar U.  ...  The word problem of a grammar U is to decide for a given string S of symbols whether there exists a feature graph G such that U(S, G) holds.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-52337-6_21">doi:10.1007/3-540-52337-6_21</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/b6yn2rbr2jafph76bvo3bteg4u">fatcat:b6yn2rbr2jafph76bvo3bteg4u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170316183121/http://www.ps.uni-saarland.de/Publications/documents/NebelSmolkaRRAD1990.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e7/ec/e7ec95519b20736b820c0e88b8b9857bc8256a3a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-52337-6_21"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars

Roderick Bloem, Joost Engelfriet
<span title="">2000</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6ovb2qpkfenhmb7mcksobrcxq" style="color: black;">Journal of computer and system sciences (Print)</a> </i> &nbsp;
The attributed tree transducer is an attribute grammar in which all attributes are trees; it is preceded by a look-ahead phase in which all attributes have finitely many values.  ...  For a survey of the relationships between context-free graph grammars and monadic second order logic, see [Cou2, Cou5, Eng6] .  ...  Finally, we define the dependency graphs of symbols (and the root), which are similar to the dependency graphs of productions in the usual type of attribute grammar [Knu] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/jcss.1999.1684">doi:10.1006/jcss.1999.1684</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tnehitak4jgthgj5ll3firaa7i">fatcat:tnehitak4jgthgj5ll3firaa7i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171002063525/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/b23/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDAyMjAwMDA5OTkxNjg0Nw%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/aa/f7/aaf713a3d4058063673cc3ad1258cb9dd2ce85f6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/jcss.1999.1684"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

On the Classification of Visual Languages by Grammar Hierarchies

KIM MARRIOTT, BERND MEYER
<span title="">1997</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dveb4iy2tfbixkquxueywoto7y" style="color: black;">Journal of Visual Languages and Computing</a> </i> &nbsp;
Although the hierarchy is based on the constraint multiset grammar formalism, we sketch how other visual language specification formalisms can be mapped into constraint multiset grammars so that a comparison  ...  The top-left production generates the start symbol, the top-right production swaps the representation of tokens in the string, the bottom-left production encodes XPaX  ...  grammars [5] [6] [7] , attributed multiset grammars [8] , constraint multiset grammars [9] and several types of graph grammars [10] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/jvlc.1997.0053">doi:10.1006/jvlc.1997.0053</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/m4vgn7ckeresvi42abbqruxmpi">fatcat:m4vgn7ckeresvi42abbqruxmpi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830050549/http://web.engr.oregonstate.edu/~burnett/CS589and584/CS589-papers/marriotGrammars.jvlc.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6a/c9/6ac916e865fbdc81aa2cbb34216a73f8cc28238a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/jvlc.1997.0053"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

XML graphs in program analysis

Anders Møller, Michael I. Schwartzbach
<span title="">2007</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4inzarpn6bccxa4a445nlydsbi" style="color: black;">Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM &#39;07</a> </i> &nbsp;
XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis.  ...  We present a unified definition, outline the key properties including validation of XML graphs against different XML schema languages, and provide a software package that enables others to make use of  ...  Intuitively, the relation n ⇒ x ; t ; a holds when unfolding from node n in the XML graph may produce XML content x, text t, and attributes a.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1244381.1244383">doi:10.1145/1244381.1244383</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/pepm/MollerS07.html">dblp:conf/pepm/MollerS07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/a6c3ooa6wng77cqrb5qzifzdzi">fatcat:a6c3ooa6wng77cqrb5qzifzdzi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170930094340/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/8c8/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDE2NzY0MjMwOTAwMTY3MQ%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/29/ea/29ea2d9a3ebc7c6ba97a95c89424c194ea3f453a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1244381.1244383"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

XML graphs in program analysis

Anders Møller, Michael Schwartzbach
<span title="">2011</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hq6x4whtd5hhlhsxzculyeamey" style="color: black;">Science of Computer Programming</a> </i> &nbsp;
XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis.  ...  We present a unified definition, outline the key properties including validation of XML graphs against different XML schema languages, and provide a software package that enables others to make use of  ...  Intuitively, the relation n ⇒ x ; t ; a holds when unfolding from node n in the XML graph may produce XML content x, text t, and attributes a.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.scico.2009.11.007">doi:10.1016/j.scico.2009.11.007</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3ojdtal5j5ajtmfoofqlzs64zu">fatcat:3ojdtal5j5ajtmfoofqlzs64zu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170930094340/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/8c8/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDE2NzY0MjMwOTAwMTY3MQ%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/29/ea/29ea2d9a3ebc7c6ba97a95c89424c194ea3f453a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.scico.2009.11.007"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Abstract predicate entailment over points-to heaplets is syntax recognition

Rene Haberland, Kirill Krinkin, Sergey Ivanovskiy
<span title="">2016</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/og6xgplevvgv3jjnjvplrvpzaq" style="color: black;">2016 18th Conference of Open Innovations Association and Seminar on Information Security and Protection of Information Technology (FRUCT-ISPIT)</a> </i> &nbsp;
The approach presented is rule-based because the abstract predicates are rule-based, the parsing technique can be interpreted as an automated fold/unfold of the corresponding heap graph.  ...  predicates are considered in this paper as abstraction technique for heap-separated configurations, and as genuine Prolog predicates which are translated straight into a corresponding formal language grammar  ...  However, Prolog rules may have argument terms on the left and the right side of ":-", this can be modelled by introducing attributes to the generated grammar, we finally obtain an attributed grammar.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/fruct-ispit.2016.7561510">doi:10.1109/fruct-ispit.2016.7561510</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/fruct/HaberlandKI16.html">dblp:conf/fruct/HaberlandKI16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nhcxe5faifcffk2jdx4e4xbyo4">fatcat:nhcxe5faifcffk2jdx4e4xbyo4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200930150448/https://arxiv.org/pdf/1906.00217v1.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1d/a7/1da7de9c14455b64592cdef4e8a17eef022b9437.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/fruct-ispit.2016.7561510"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Partial Evaluation of Order-sorted Equational Programs modulo Axioms [article]

Maria Alpuente and Angel Cuenca and Santiago Escobar and Jose Meseguer
<span title="2016-08-11">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Our partial evaluation scheme is based on an automatic unfolding algorithm that computes term variants and relies on equational least general generalization for ensuring global termination.  ...  op _;_ : Grammar Grammar -> Grammar [assoc comm id: mt] . op _|_|_ : Symbol String Grammar -> Parsing . var E : for some substitution θ A set T of terms is closed modulo B (w.r.t.  ...  TSymbol . vars N M : NSymbol . var L : String . var G : Grammar . fmod Parser is sorts Symbol NSymbol TSymbol String Production Grammar Parsing . subsort Production < Grammar .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1608.03424v1">arXiv:1608.03424v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wg4fwt5sxrg2rg5a6atv4jee5u">fatcat:wg4fwt5sxrg2rg5a6atv4jee5u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200825125219/https://arxiv.org/pdf/1608.03424v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e7/52/e752cc1bb9dbcc003bda566eff2226b5accbde5b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1608.03424v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers

Eric Badouel, Bernard Fotsing, Rodrigue Tchougong
<span title="">2011</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uy5mv2ncw5eahkdx47hkrglxmm" style="color: black;">Electronical Notes in Theoretical Computer Science</a> </i> &nbsp;
Evaluation of attributes w.r.t. an attribute grammar can be obtained by inductively computing a function expressing the dependencies of the synthesized attributes on inherited attributes.  ...  This higher-order functional approach to attribute grammars leads to a straightforward implementation using a higher-order lazy functional language like Haskell.  ...  If the attribute grammar is non circular (there are no cyclic dependencies between attributes) then one can can compute the value of each attribute using a topological sort of the dependency graph (whose  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2011.02.015">doi:10.1016/j.entcs.2011.02.015</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bvaeuwfahrhlbmr34dnp3fba6q">fatcat:bvaeuwfahrhlbmr34dnp3fba6q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190325122413/https://core.ac.uk/download/pdf/82617563.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7b/5a/7b5ae2a87270504567c4484573dc3c6d4b7954d0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2011.02.015"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Tree Transducers and Tree Compressions [chapter]

Sebastian Maneth, Giorgio Busatto
<span title="">2004</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Consider an attribute grammar that generates trees as output.  ...  The main result is that a sharing graph representation of the corresponding output tree can be computed in time linear in the size of s.  ...  The first author is grateful to Markus Lohrey for providing many useful references, and in particular for the introduction to the concept of sharing graphs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-24727-2_26">doi:10.1007/978-3-540-24727-2_26</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7tzr7rrdyjf5lny7i2pdzilyqq">fatcat:7tzr7rrdyjf5lny7i2pdzilyqq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170917200738/https://link.springer.com/content/pdf/10.1007%2F978-3-540-24727-2_26.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d7/68/d768886d001cc760b39a40bf3806b64a9a3347a7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-24727-2_26"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Symbol–Relation Grammars: A Formalism for Graphical Languages

F. Ferrucci, G. Pacini, G. Satta, M.I. Sessa, G. Tortora, M. Tucci, G. Vitiello
<span title="">1996</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/joe2ngto45hbnl3pncnesnq344" style="color: black;">Information and Computation</a> </i> &nbsp;
The present paper is concerned with the formalism of Symbol Relation Grammars (SR grammars, for short).  ...  The most meaningful features of SR grammars as well as their generative power are compared with those of well-known graph grammar families.  ...  The new relation symbols are unfolded into the original ones, only when terminal s-items are generated. Theorem 4.1. Let L be a language generated by an SR grammar G.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/inco.1996.0090">doi:10.1006/inco.1996.0090</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oo544mjp2jamvdsxzg5eb4spaq">fatcat:oo544mjp2jamvdsxzg5eb4spaq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190418080615/https://core.ac.uk/download/pdf/82361305.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ed/4d/ed4d657e92185cc6c320053c449b3c23d0c219ce.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1006/inco.1996.0090"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Static Analysis for Java Servlets and JSP

Christian Kirkegaard, Anders Møller
<span title="2006-06-12">2006</span> <i title="Aarhus University Library"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/433eg2tipzegfkgt5m5cmv46zq" style="color: black;">BRICS Report Series</a> </i> &nbsp;
Our approach builds on a collection of program analysis techniques developed earlier in the JWIG and X<small>ACT</small> projects, combined with work on balanced context-free grammars.  ...  The language L(SG) of a summary graph SG is intuitively the set of XML trees that can be obtained by unfolding it, starting from a root node.  ...  Given a summary graph corresponding to the output of a servlet method we recognize the links and forms by searching (that is, unfolding according to the contents map, starting from the roots) for element  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7146/brics.v13i10.21915">doi:10.7146/brics.v13i10.21915</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/z4du4hyrdrektdqlfgog2hutri">fatcat:z4du4hyrdrektdqlfgog2hutri</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20101224013002/http://www.brics.dk/RS/06/8/BRICS-RS-06-8.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/71/e9/71e9dd32c9a37d42151e3606a1c631ead14994ab.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7146/brics.v13i10.21915"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Static Analysis for Java Servlets and JSP

Christian Kirkegaard, Anders Møller
<span title="2006-04-12">2006</span> <i title="Aarhus University Library"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/433eg2tipzegfkgt5m5cmv46zq" style="color: black;">BRICS Report Series</a> </i> &nbsp;
Our approach builds on a collection of program analysis techniques developed earlier in the JWIG and X<small>ACT</small> projects, combined with work on balanced context-free grammars.  ...  The language L(SG) of a summary graph SG is intuitively the set of XML trees that can be obtained by unfolding it, starting from a root node.  ...  Given a summary graph corresponding to the output of a servlet method we recognize the links and forms by searching (that is, unfolding according to the contents map, starting from the roots) for element  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7146/brics.v13i8.21914">doi:10.7146/brics.v13i8.21914</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bhhrkdg4t5bbhdpmymavtkdkuq">fatcat:bhhrkdg4t5bbhdpmymavtkdkuq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20101224013002/http://www.brics.dk/RS/06/8/BRICS-RS-06-8.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/71/e9/71e9dd32c9a37d42151e3606a1c631ead14994ab.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7146/brics.v13i8.21914"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems [chapter]

Paolo Baldan, Barbara König, Ingo Stürmer
<span title="">2004</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Since the representation of code generators in terms of graph grammars typically makes use of rules with negative application conditions, the unfolding approach is extended to deal with this feature.  ...  This is done by formalising the behaviour of a code generator by means of graph transformation rules and exploiting unfolding-based techniques.  ...  Given a graph G and a match in it, G can be rewritten to H (in symbols: G ⇒ H), by applying rule r as specified in the double-pushout approach [8] . Definition 4 (Graph grammar).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-30203-2_15">doi:10.1007/978-3-540-30203-2_15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fkiz5g2pebduzetj364is3dbda">fatcat:fkiz5g2pebduzetj364is3dbda</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830065717/http://www2.informatik.uni-stuttgart.de/fmi/szs/publications/koenigba/icgt04.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f6/ce/f6cedd7c80893ea00bc9be8f31299f1e0e9b5f08.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-30203-2_15"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Static Analysis for Java Servlets and JSP [chapter]

Christian Kirkegaard, Anders Møller
<span title="">2006</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Our approach builds on a collection of program analysis techniques developed earlier in the JWIG and Xact projects, combined with work on balanced context-free grammars.  ...  The language L(SG) of a summary graph SG is intuitively the set of XML trees that can be obtained by unfolding it, starting from a root node.  ...  Given a summary graph corresponding to the output of a servlet method we recognize the links and forms by searching (that is, unfolding according to the contents map, starting from the roots) for element  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11823230_22">doi:10.1007/11823230_22</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cjokefgy65a5rmyvvjxgzuem7q">fatcat:cjokefgy65a5rmyvvjxgzuem7q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20101224013002/http://www.brics.dk/RS/06/8/BRICS-RS-06-8.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/71/e9/71e9dd32c9a37d42151e3606a1c631ead14994ab.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11823230_22"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 3,262 results