Filters








2,360 Hits in 5.1 sec

Graph Rewriting Techniques in Engineering Design

Lothar Kolbeck, Simon Vilgertshofer, Jimmy Abualdenien, André Borrmann
2022 Frontiers in Built Environment  
The paper provides an overview of the current state-of-the-art in graph rewriting and its applications in engineering design, with a focus on the built environment.  ...  On the other hand, the assembly of rewriting rules into graph grammars allows for an exhaustive search of the solution space of the engineering problem at hand.  ...  In engineering design, it is commonly implied a typed and attributed graph, sometimes referred to as property graph (Robinson et al., 2015) .  ... 
doi:10.3389/fbuil.2021.815153 fatcat:my2r2ov4izey5hkmqiohpcluau

Modeling Dynamic Programming Problems over Sequences and Trees with Inverse Coupled Rewrite Systems

Robert Giegerich, H´el'ene Touzet
2014 Algorithms  
The new approach introduces inverse coupled rewrite systems.  ...  However, algorithms often lack abstraction and are difficult to implement, tedious to debug, and delicate to modify.  ...  Acknowledgments Thanks go to Michael Hanus and Benedikt Löwes for help with implementing two ICOREs in the functional-logic language Curry. Thanks to B. Löwes also for a careful reading of the text.  ... 
doi:10.3390/a7010062 fatcat:swsio2xkvvhgroq2ltjp6n2kaa

Twenty Years of Rewriting Logic [chapter]

José Meseguer
2010 Lecture Notes in Computer Science  
Rewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality.  ...  logical framework uses; (iii) its language implementations and its formal tools; and (iv) its many applications to automated deduction, software and hardware specification and verification, security,  ...  I thank the organizers of WRLA 2010 for giving me the opportunity and the stimulus to do some reflecting, surveying, and guessing about rewriting logic at this point, when twenty years have passed since  ... 
doi:10.1007/978-3-642-16310-4_2 fatcat:ho7s76r67nc63bndpoptbh5k4e

Validating Behavioral Component Interfaces in Rewriting Logic

Einar Broch Johnsen, Olaf Owe, Arild B. Torjusen
2006 Electronical Notes in Theoretical Computer Science  
And we thank the anonymous referees for constructive criticism and hints to related work.  ...  for insightful and constructive criticism.  ...  Paper overview: Sect. 2 presents a formalism for behavioral interfaces. Sect. 3 presents rewriting logic and the Maude tool.  ... 
doi:10.1016/j.entcs.2005.12.069 fatcat:chb5rxirp5afld7emzxe6pdlim

Twenty years of rewriting logic

José Meseguer
2012 The Journal of Logic and Algebraic Programming  
Rewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality.  ...  logical framework uses; (iii) its language implementations and its formal tools; and (iv) its many applications to automated deduction, software and hardware specification and verification, security,  ...  I thank the organizers of WRLA 2010 for giving me the opportunity and the stimulus to do some reflecting, surveying, and guessing about rewriting logic at this point, when twenty years have passed since  ... 
doi:10.1016/j.jlap.2012.06.003 fatcat:5tx4a5uxlvapfpf5fajozkbboi

Rewriting-Based Techniques for Runtime Verification

Grigore Roşu, Klaus Havelund
2005 Automated Software Engineering : An International Journal  
The presented work is part of an ambitious runtime verification and monitoring project at NASA Ames, called PathExplorer, and demonstrates that rewriting can be a tractable and attractive means for experimenting  ...  This algorithm is further improved to build automata on-the-fly via caching and reuse of rewrites (called memoization), resulting in a very efficient and small Maude program that can be used to monitor  ...  The authors warmly thank the anonymous reviewers for their very detailed and useful comments and suggestions on how to improve this paper.  ... 
doi:10.1007/s10515-005-6205-y fatcat:qjtklefxsbcqfpcfpatctavl3a

Detecting Redundant CSS Rules in HTML5 Applications: A Tree-Rewriting Approach [article]

Matthew Hague, Anthony Widjaja Lin, Luke Ong
2015 arXiv   pre-print
In this paper, we introduce an abstraction of HTML5 applications based on monotonic tree-rewriting and study its "redundancy problem".  ...  Each CSS rule consists of a node selector (given in an XPath-like query language) and a declaration block (assigning values to selected nodes' display attributes).  ...  Hague is supported by the Engineering and Physical Sciences Research Council [EP/K009907/1]. Lin is supported by a Yale-NUS Startup Grant.  ... 
arXiv:1412.5143v4 fatcat:itjwxmrranhc7h6luw7f5krzga

Detecting redundant CSS rules in HTML5 applications: a tree rewriting approach

Matthew Hague, Anthony W. Lin, C.-H. Luke Ong
2015 SIGPLAN notices  
We give a quick overview of HTML5 applications via a simple example in Section 2. We then introduce our tree rewriting model in Section 3.  ...  Each CSS rule consists of a node selector and a declaration block (which assigns values to selected nodes' display attributes).  ...  Hague is supported by the Engineering and Physical Sciences Research Council [EP/K009907/1]. Lin is supported by a Yale-NUS Startup Grant.  ... 
doi:10.1145/2858965.2814288 fatcat:uryw6kb6prcebmwycszcplx3ya

Detecting redundant CSS rules in HTML5 applications: a tree rewriting approach

Matthew Hague, Anthony W. Lin, C.-H. Luke Ong
2015 Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications - OOPSLA 2015  
We give a quick overview of HTML5 applications via a simple example in Section 2. We then introduce our tree rewriting model in Section 3.  ...  Each CSS rule consists of a node selector and a declaration block (which assigns values to selected nodes' display attributes).  ...  Hague is supported by the Engineering and Physical Sciences Research Council [EP/K009907/1]. Lin is supported by a Yale-NUS Startup Grant.  ... 
doi:10.1145/2814270.2814288 dblp:conf/oopsla/HagueLO15 fatcat:q7s3uhjmxndevme2nxuwm72sy4

Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars [chapter]

Simon M. Becker, Bernhard Westfechtel
2003 Lecture Notes in Computer Science  
Triple graph grammars, an extension of pair graph grammars, were introduced for the specification of graph translaters.  ...  We developed a framework which constitutes an industrial application of triple graph grammars. It solves integration problems in a specific domain, namely design processes in chemical engineering.  ...  For further details on attribute assignments, the reader is referred to [5] .  ... 
doi:10.1007/978-3-540-39890-5_5 fatcat:qgj7zacaibcblhydqcdswfybva

Introduction to COMPUGRAPH

Hartmut Ehrig
1995 Electronical Notes in Theoretical Computer Science  
Starting with an overview of the history of graph grammars and graph transformations the research goals and main results are presented within the following three research areas: Foundations, Concurrency  ...  , and Graph Transformations for Speci cation and Programming.  ...  Janssens in the Netherlands initiated the \Node-Label Controlled (NLC) approach" to graph grammars.  ... 
doi:10.1016/s1571-0661(05)80185-9 fatcat:gwb5vskzgbe6jj3pny5n74bccm

Transforming Provenance Using Redaction [chapter]

2014 Secure Data Provenance and Inference Control with Semantic Web  
Our rewriting procedure converts a high level specification of a redaction policy into a graph grammar rule that transforms a provenance graph into a redacted provenance graph.  ...  Traditional redaction techniques do not extend to the directed graph representation of provenance. In this paper, we propose a graph grammar approach for rewriting redaction policies over provenance.  ...  We motivate the general descriptions of our graph rewriting system with use cases taken from a medical domain.  ... 
doi:10.1201/b17258-16 fatcat:zuypgiq27rfs3dbbss2bv4yznq

Transforming provenance using redaction

Tyrone Cadenhead, Vaibhav Khadilkar, Murat Kantarcioglu, Bhavani Thuraisingham
2011 Proceedings of the 16th ACM symposium on Access control models and technologies - SACMAT '11  
Our rewriting procedure converts a high level specification of a redaction policy into a graph grammar rule that transforms a provenance graph into a redacted provenance graph.  ...  Traditional redaction techniques do not extend to the directed graph representation of provenance. In this paper, we propose a graph grammar approach for rewriting redaction policies over provenance.  ...  We motivate the general descriptions of our graph rewriting system with use cases taken from a medical domain.  ... 
doi:10.1145/1998441.1998456 dblp:conf/sacmat/CadenheadKKT11 fatcat:byc45vc7irfirj63qaq3q65agy

OPTRAN - A language/system for the specification of program transformations: System overview and experiences [chapter]

Peter Lipps, Ulrich Möncke, Reinhard Wilhelm
1989 Lecture Notes in Computer Science  
Given such a specification, the system will automatically generate the transformation system, mainly consisting of an attribute evaluator and reevaluator, as well as a tree analyzer and transformer.  ...  Programs are represented by attributed abstract syntax trees (AAST).  ...  The reader is referred to [He88] for more details. System overview OPTRAN is a very-high-level language for the specification of attributed abstract syntax trees and tree transformations.  ... 
doi:10.1007/3-540-51364-7_4 fatcat:ns2dk5cqzjdbbdw3k7rkxdqyda

Towards 2D Traceability in a Platform for Contract Aware Visual Transformations with Tolerated Inconsistencies

Pieter Gorp, Frank Altheide, Dirk Janssens
2006 International Enterprise Distributed Object Computing Conference, Proceedings  
This motivates the role of traceability links in two dimensions: links between application models allow one to maintain consistency incrementally and tolerate inconsistencies in a controlled manner.  ...  Based on an established requirements engineering case study, the paper illustrates the need for developer interaction and the controlled tolerance of inconsistencies.  ...  Acknowledgements This work has been sponsored by the European research training network "Syntactic and Semantic Integration of Visual Modeling Techniques (SegraVis)" through the University of Antwerp.  ... 
doi:10.1109/edoc.2006.61 dblp:conf/edoc/GorpAJ06 fatcat:dqk7q7idc5dqjdfheutxgmldyu
« Previous Showing results 1 — 15 out of 2,360 results