Results 41 to 50 of about 1,842,530 (291)
Order Reconfiguration under Width Constraints
In this work, we consider the following order reconfiguration problem: Given a graph $G$ together with linear orders $\omega$ and $\omega'$ of the vertices of $G$, can one transform $\omega$ into $\omega'$ by a sequence of swaps of adjacent elements in ...
Emmanuel Arrighi +3 more
doaj +1 more source
Graph Algorithm Animation with Grrr [PDF]
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and
Peter J. Rodgers +3 more
core +1 more source
ROVER: RTL Optimization via Verified E-Graph Rewriting [PDF]
Manual register transfer level (RTL) design and optimization remains prevalent across the semiconductor industry because commercial logic and high-level synthesis tools are unable to match human designs.
Samuel Coward +2 more
semanticscholar +1 more source
A Graph Rewriting Visual Language for Database Programming [PDF]
Textual database programming languages are computationally complete, but have the disadvantage of giving the user a non-intuitive view of the database information that is being manipulated.
Rodgers, Peter +5 more
core +1 more source
Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework [PDF]
Sesqui-pushout (SqPO) rewriting is a variant of transformations of graph-like and other types of structures that fit into the framework of adhesive categories where deletion in unknown context may be implemented.
Nicolas Behr
doaj +1 more source
A graph rewriting programming language for graph drawing [PDF]
This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
Structure and Properties of Traces for Functional Programs [PDF]
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support program comprehension and debugging.
Luo, Yong +3 more
core +1 more source
Structured Operational Semantics for Graph Rewriting [PDF]
Process calculi and graph transformation systems provide models of reactive systems with labelled transition semantics (LTS). While the semantics for process calculi is compositional, this is not the case for graph transformation systems, in general ...
A. Dorman, T. Heindel, B. König
doaj +1 more source
Conditional Bisimilarity for Reactive Systems [PDF]
Reactive systems \`a la Leifer and Milner, an abstract categorical framework for rewriting, provide a suitable framework for deriving bisimulation congruences.
Mathias Hülsbusch +3 more
doaj +1 more source
A Framework for Rewriting Families of String Diagrams [PDF]
We describe a mathematical framework for equational reasoning about infinite families of string diagrams which is amenable to computer automation. The framework is based on context-free families of string diagrams which we represent using context-free ...
Vladimir Zamdzhiev
doaj +1 more source

