We present strategic port graph rewriting as a basis for the implementation of visual modelling and analysis tools. The goal is to facilitate the specification, analysis and simulation of complex systems, using port graphs. A system is represented by an initial graph and a collection of graph rewriting rules, together with a user-defined strategy to control the application of rules. The strateg...

Pattern matching is the most time-cost expensive part of the graph rewriting process. When applying a given rewriting rule, most graph rewriting systems check the entire host graph for possible matches. In our modal logic theorem prover based on graph rewriting, LoTREC, we use the events that are emitted when the applied rules change locally the host graph, in order to reduce the effect of this...

We introduce rewriting with two sets of rules, the rst interpreted equationally and the second not. A semantic view considers equational rules as deening an equational theory and reduction rules as deening a rewrite relation modulo this theory. An operational view considers both sets of rules as similar. We introduce suucient properties for these two views to be equivalent (up to diierent notio...

This work introduces collected size semantics of strict functional programs over lists. It is presented via non-deterministic numerical functions annotating types. These functions are defined by conditional rewriting rules generated during type inference. We focus on the connection between the size rewriting rules and lower and upper bounds on size dependencies, where the bounds are given by po...

Abstract Rewriting Modulo SMT combines two powerful automated deduction techniques (1) rewriting and (2) SMT-solving. enables the specification of behavior systems using rules, while theories specify system properties. is enabled by combining existing tools, such as Maude solvers. Search algorithms used for carrying out SMT, however, cannot exploit incremental solving features available in solv...

For simplification to have good theoretical properties, the set of simp rules must be terminating and confluent. Completion is the process of transforming a set of simp rules, and attempting to make them terminating and confluent. We give a brief introduction to the theory of completion, and then describe an implementation of (basic) completion in HOL Light. Our notation follows that in [BN98]....

Data-flow optimizations are usually implemented on low-level intermediate representations. This is not appropriate for source-to-source optimizations, which reconstruct a source level program after transformation. In this paper we show how constant propagation, a well known data-flow optimization problem, can be implemented on abstract syntax trees in Stratego, a rewriting system extended with ...