Results 21 to 30 of about 12,133 (300)
P3 problem and Magnolia language: Specializing array computations for emerging architectures
Frontiers in Computer Science, 2022 The problem of producing portable high-performance computing (HPC) software that is cheap to develop and maintain is called the P3 (performance, portability, productivity) problem.
Benjamin Chetioui +4 more
doaj +1 more source
Modular Complexity Analysis for Term Rewriting [PDF]
Logical Methods in Computer Science, 2014 All current investigations to analyze the derivational complexity of term rewrite systems are based on a single termination method, possibly preceded by transformations. However, the exclusive use of direct criteria is problematic due to their restricted
Harald Zankl, Martin Korp
doaj +1 more source
Linear Compressed Pattern Matching for Polynomial Rewriting (Extended Abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 This paper is an extended abstract of an analysis of term rewriting where the terms in the rewrite rules as well as the term to be rewritten are compressed by a singleton tree grammar (STG).
Manfred Schmidt-Schauss
doaj +1 more source
Convergence in Infinitary Term Graph Rewriting Systems is Simple (Extended Abstract) [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 In this extended abstract, we present a simple approach to convergence on term graphs that allows us to unify term graph rewriting and infinitary term rewriting. This approach is based on a partial order and a metric on term graphs.
Patrick Bahr
doaj +1 more source
Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 The tree automaton completion is an algorithm used for proving safety properties of systems that can be modeled by a term rewriting system. This representation and verification technique works well for proving properties of infinite systems like ...
Benoît Boyer, Thomas Genet
doaj +1 more source
Infinitary rewriting: meta-theory and convergence [PDF]
, 2007 When infinitary rewriting was introduced by Kaplan et.al. at the beginning of the 1990s, its term universe was explained as the metric completion of a metric on finite terms.
Kahrs, Stefan
core +1 more source
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems [PDF]
Logical Methods in Computer Science, 2012 We give a method to prove confluence of term rewriting systems that contain non-terminating rewrite rules such as commutativity and associativity.
Takahito Aoto, Yoshihito Toyama
doaj +1 more source
Controlled Term Rewriting [PDF]
, 2011 Motivated by the problem of verification of imperative tree transformation programs, we study the combination, called controlled term rewriting systems (CntTRS), of term rewriting rules with con- straints selecting the possible rewrite positions. These constraints are specified, for each rewrite rule, by a selection automaton which defines a set of ...
Jacquemard, Florent +2 more
openaire +2 more sources
Unfolding of Finite Concurrent Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We consider recognizable trace rewriting systems with level-regular contexts (RTL). A trace language is level-regular if the set of Foata normal forms of its elements is regular. We prove that the rewriting graph of a RTL is word-automatic.
Alexandre Mansard
doaj +1 more source
Complexity Hierarchies and Higher-order Cons-free Term Rewriting [PDF]
Logical Methods in Computer Science, 2017 Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of the left-hand sides; the computational intuition is that rules cannot build new data structures.
Cynthia Kop, Jakob Grue Simonsen
doaj +1 more source