We consider a pushdown automaton as a word-rewriting system with labelled rules applied only in a prefix way. The notion of pushdown transition graph is then extended to the notion of prefix transition graph generated by a word-rewriting system and accessible from a given axiom. Such accessible prefix transition graphs are context-free graphs in the sense of Muller and Schupp (1985), and we sho...

By extending nondeterministic transition systems with concurrency and copy mechanisms, Axiomatic Rewriting Theory provides a uniform framework for a variety of rewriting systems, ranging from higher-order systems to Petri nets and process calculi. Despite its generality, the theory is surprisingly simple, based on a mild extension of transition systems with independence: an axiomatic rewriting ...

There are properties of rewriting systems that are characterized by means of some syntactic conditions (e.g., requiring left-linear and non-overlapping rules for ensuring confluence). Sometimes, though, a given property might hold but the syntactic conditions are not met. This is particularly true when the systems are obtained by some automated transformation. In this paper, we introduce a tech...

Model checking of recursion schemes, known as higher-order model checking, has actively been studied recently and is becoming a basis for verification of higher-order programs. Some practical model checking algorithms have been developed based on the reduction from model checking to intersection type inference, but they are not completely satisfactory. We propose a novel approach to developing ...

Speciication and rapid prototyping of graph manipulating software by means of PROgrammed Graph REwriting Systems (PROGRES) is a paradigm, which attracts more and more interests in various elds of computer science. Nowadays produced speci-cations for process modelling tools, database query languages, or Conceptual Graph manipulations have a typical size of about 100 printed pages. They suuer sev...

As an example of the optimization of an evolutionary system design, a string rewriting system is studied. A set of rewriting rules that defines the growth of a string is experimentarily optimized in terms of maximizing the 'replicative capacity', that is the occurrence ratio of self-replicating strings. It is shown that the most optimized rule set allows many strings to self-replicate by using ...

Rewriting logic can be used to prototype systems for automated deduction. In this paper, we illustrate how this approach allows experiments with deduction strategies in a flexible and conceptually satisfying way. This is achieved by exploiting the reflective property of rewriting logic. By specifying a theorem prover in this way one quickly obtains a readable, reliable and reasonably efficient ...

Lean is an experimental language for specifying computations in terms of graph rewriting. It is based on an alternative to Term Rewriting Systems (TRS) in which the terms are replaced by graphs. Such a Graph Rewriting System (GRS) consists of a set of graph rewrite rules which specify how a graph may be rewritten. Besides supporting functional programming, Lean also describes imperative constru...

ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a resolution/paramodulation theorem proving system. Term rewriting is at the core of the two procedures, but details of the rewriting procedure itself are irrelevant. The ACL2 encapsulate construct was used to assert the exi...

Our goal is to give a list of rewriting properties, and then automatically find a term rewriting system (TRS) satisfying these properties. In earlier work we did this for finite abstract reduction systems; in this paper we extend the approach to ground term rewriting systems over constants and one unary symbol. In particular, we fully automatically find a TRS that is locally confluent but not c...