Filters








1,818 Hits in 4.5 sec

Constructing a bidirectional transformation between BPMN and BPEL with a functional logic programming language

Steffen Mazanek, Michael Hanus
2011 Journal of Visual Languages and Computing  
In order to be self-contained, this article also surveys context-free hypergraph grammars, the concepts of the programming language Curry, the example languages BPMN and BPEL, and the ideas of the Grappa  ...  In this article we show how functional logic programming techniques can be used to construct a bidirectional transformation between structured process models of the business process modeling notation (  ...  Having this in mind, graph parsing appears to be a domain asking for multiparadigm declarative programming languages [24] such as Curry. In this domain their benefits really stand out.  ... 
doi:10.1016/j.jvlc.2010.11.005 fatcat:hyoegkuzbres5ixexg6czyqgwu

Specifying and Implementing Visual Process Modeling Languages with DiaGen1 1Support by the Esprit Working Group AppliGraph is gratefully acknowledged

Mark Minas, Berthold Hoffmann
2001 Electronical Notes in Theoretical Computer Science  
This is demonstrated with an editor and animator for statecharts.  ...  This paper describes how a diagram language can be specified, based on graphs, graph grammars, and transformation rules, and how the diagram editor generator DiaGen generates a diagram editor from such  ...  specifications based on hypergraphs, hypergraph grammars, and hypergraph transformation.  ... 
doi:10.1016/s1571-0661(04)80944-7 fatcat:ludzmnwdivd45aqmpvfcihcnqi

Syntax Definition with Graphs

Mark Minas
2006 Electronical Notes in Theoretical Computer Science  
Syntax definition of visual languages is required for a precise definition of a visual language; it is a requirement for the automatic creation of tools that process diagrams of the language.  ...  The paper presents in a tutorial like way the DiaGen approach of defining visual language syntax with hypergraphs and hypergraph grammars.  ...  The layouter is required for syntax-directed editing, too: Syntax-directed editing operations are specified by programmed hypergraph transformations (cf. [13] ) which get selected by the user.  ... 
doi:10.1016/j.entcs.2005.12.011 fatcat:2uv4hlpej5cl5i3jgnuhr3lpqm

Abstraction in Graph-Transformation Based Diagram Editors

Oliver Köth, Mark Minas
2001 Electronical Notes in Theoretical Computer Science  
This extended abstract recalls how visual language editors benefit from graph grammars and how the editor-generator DiaGen is based on this approach.  ...  We then outline how generated editors can create abstract diagram representations for further processing, e. g. for communication with other tools or for diagram visualizations with varying, adjustable  ...  XMI data) or to use graph transformations to describe modifications of the abstract model (program structure transformations in the case of UML) and visualize the results directly.  ... 
doi:10.1016/s1571-0661(04)00182-3 fatcat:527gl3kv4rejjdnlhafj2nf4g4

Metrics and models for reordering transformations

Michelle Mills Strout, Paul D. Hovland
2004 Proceedings of the 2004 workshop on Memory system performance - MSP '04  
This paper describes models for determining which combination of run-time data-and iterationreordering heuristics will result in the best performance for a given dataset.  ...  We propose that the data-and iterationreordering transformations be viewed as approximating minimal linear arrangements on two separate hypergraphs: a spatial locality hypergraph and a temporal locality  ...  We thank Todd Munson (Argonne National Laboratory) for supplying and explaining the mesh quality improvement benchmark and the COSMIC project (University of Maryland) for supplying implementations of several  ... 
doi:10.1145/1065895.1065899 dblp:conf/ACMmsp/StroutH04 fatcat:pjxo736imncaljinjkaiu5m6ii

Optimal relay location and power allocation for low SNR broadcast relay channels

Mohit Thakur, Nadia Fawaz, Muriel Medard
2011 2011 Proceedings IEEE INFOCOM  
Using this switched hypergraph approach, we model the original problem as a continuous yet nonconvex network optimization program.  ...  Please share how this access benefits you. Your story matters.  ...  Since, the program (D) is simply program (B) (but for arbitrary placement of destination nodes), the structure of (D) is the same as (B).  ... 
doi:10.1109/infcom.2011.5935119 dblp:conf/infocom/ThakurFM11 fatcat:en643bhy7jeirjnzii33hplpvu

MESH: A Flexible Distributed Hypergraph Processing System [article]

Benjamin Heintz, Rankyung Hong, Shivangi Singh, Gaurav Khandelwal, Corey Tesdahl, Abhishek Chandra
2019 arXiv   pre-print
In this paper, we present MESH, a flexible distributed framework for scalable hypergraph processing.  ...  Our framework provides a flexible implementation based on an underlying graph processing system, and enables different design choices for the key implementation issues of partitioning a hypergraph representation  ...  The bigger the size of the dataset is, the greater the performance benefit.  ... 
arXiv:1904.00549v2 fatcat:lgfgdpjnvjecxnwcrsm35pexpa

MESH: A Flexible Distributed Hypergraph Processing System

Benjamin Heintz, Rankyung Hong, Shivangi Singh, Gaurav Khandelwal, Corey Tesdahl, Abhishek Chandra
2019 2019 IEEE International Conference on Cloud Engineering (IC2E)  
In this paper, we present MESH, a flexible distributed framework for scalable hypergraph processing.  ...  Our framework provides a flexible implementation based on an underlying graph processing system, and enables different design choices for the key implementation issues of hypergraph representation and  ...  The bigger the size of the dataset is, the greater the performance benefit.  ... 
doi:10.1109/ic2e.2019.00-11 dblp:conf/ic2e/HeintzHSKTC19 fatcat:wm5acuzafjdn5kvbvaqtkttviq

Automata-Based Optimization of Interaction Protocols for Scalable Multicore Platforms [chapter]

Sung-Shik T. Q. Jongmans, Sean Halle, Farhad Arbab
2014 Lecture Notes in Computer Science  
We optimize a generalization of the producer-consumer pattern, by applying CA transformations and prove the correctness of the transforms.  ...  This form of protocol programming specifies only what needs to be done and leaves virtually all how -decisions involved in obtaining a concrete implementation for the compiler and the run-time system to  ...  The inability of compilers for lower-level languages to do such optimizations seems a significant disadvantage of using such languages for multicore programming.  ... 
doi:10.1007/978-3-662-43376-8_5 fatcat:6sanocuzibbwzbqb6caq6kqt6e

A Graph-based Model for GPU Caching Problems [article]

Lingda Li, Ari B. Hayes, Stephen A. Hackler, Eddy Z. Zhang, Mario Szegedy, Shuaiwen Leon Song
2016 arXiv   pre-print
Modeling data sharing in GPU programs is a challenging task because of the massive parallelism and complex data sharing patterns provided by GPU architectures.  ...  However, we discover that the previous methods are either inaccurate or expensive when applied to GPU programs.  ...  PROGRAM TRANSFORMATION In this section, we will introduce how to apply the partition result of our EP model to GPU programs for data sharing optimization.  ... 
arXiv:1605.02043v1 fatcat:6fefayucc5dathpxsya7j7kayi

Translating Java Code to Graph Transformation Systems [chapter]

Andrea Corradini, Fernando Luís Dotti, Luciana Foss, Leila Ribeiro
2004 Lecture Notes in Computer Science  
We propose a faithful encoding of Java programs (written in a suitable fragment of the language) to Graph Transformation Systems.  ...  , namely one rule for each method or constructor declared in the program.  ...  Acknowledgement We would like to thank the anonymous referees for their detailed comments and constructive suggestions.  ... 
doi:10.1007/978-3-540-30203-2_27 fatcat:qhqa55dwyjc7tca4paaacq6k2q

Functorial String Diagrams for Reverse-Mode Automatic Differentiation [article]

Mario Alvarez-Picallo, Dan R. Ghica, David Sprunger, Fabio Zanasi
2021 arXiv   pre-print
To give an efficient yet principled implementation of the AD algorithm we define a sound and complete representation of hierarchical string diagrams as a class of hierarchical hypergraphs we call hypernets  ...  Using this new syntax we formulate an automatic differentiation algorithm for (applied) simply typed lambda calculus in the style of [Pearlmutter and Siskind 2008] and we prove for the first time its soundness  ...  AD is an established technique for evaluating the derivative of a function specified by a computer program, a particularly challenging exercise when the program contains higher-order sub-terms.  ... 
arXiv:2107.13433v1 fatcat:2bnsqea5nvgxhhsakuwlhwq6oi

"Everything Is Everything" Revisited: Shapeshifting Data Types with Isomorphisms and Hylomorphisms

Paul Tarau, University of North Texas
2009 Complex Systems  
This paper is an exploration of isomorphisms between elementary data types (e.g., natural numbers, sets, finite functions, graphs, hypergraphs) and their extension to hereditarily finite universes through  ...  Other applications range from stream iterators on combinatorial objects to succinct data representations and the generation of random instances. † a general framework for bijective encodings between heterogeneous  ...  Encoding Hypergraphs Definition 1. A hypergraph (also called set system) is a pair H  HX, EL where X is a set and E is a set of nonempty subsets of X.  ... 
doi:10.25088/complexsystems.18.4.475 fatcat:y6t5qz6vwvfgfdfpsc3qgmfci4

Toward a Formal Model of Cognitive Synergy [article]

Ben Goertzel
2017 arXiv   pre-print
; hypergraph-based agents (in which "cognit" operations are carried out via hypergraphs); hypergraph agents with a rich language of nodes and hyperlinks (such as the OpenCog framework provides); "PGMC"  ...  A notion of cognitive synergy is developed for cognitive processes acting within PGMC agents, based on developing a formal notion of "stuckness," and defining synergy as a relationship between cognitive  ...  "program graphs" embedded in the hypergraph.  ... 
arXiv:1703.04361v1 fatcat:4ymubpftazdlpa4qg6ynlw4zsa

Generating Correctness-Preserving Editing Operations for Diagram Editors

Steffen Mazanek, Mark Minas
2009 Electronic Communications of the EASST  
These operations provably preserve the correctness of the diagram. The proposed approach requires a specification of the visual language by a hypergraph grammar.  ...  So far, editing operations had to be specified or programmed by the editor developer.  ...  These benefits come for free, i.e., the editor developer does not need to define these syntax-directed editing operations anymore.  ... 
doi:10.14279/tuj.eceasst.18.262 dblp:journals/eceasst/MazanekM09 fatcat:yochakazgbdprkawnp2hxha4n4
« Previous Showing results 1 — 15 out of 1,818 results