Results 21 to 30 of about 92,734 (332)
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
A Rewriting System for Convex Optimization Problems [PDF]
Journal of Control and Decision, 2017 We describe a modular rewriting system for translating optimization problems written in a domain-specific language to forms compatible with low-level solver interfaces.
Akshay Agrawal +3 more
semanticscholar +1 more source
Rewriting a Deep Generative Model [PDF]
European Conference on Computer Vision, 2020 A deep generative model such as a GAN learns to model a rich set of semantic and physical rules about the target distribution, but up to now, it has been obscure how such rules are encoded in the network, or how a rule could be changed. In this paper, we
David Bau +4 more
semanticscholar +1 more source
Pure tensor program rewriting via access patterns (representation pearl) [PDF]
MAPS@PLDI, 2021 Tensor kernels in machine learning (ML) often correspond to pure mathematical expressions, making term rewriting an attractive strategy for optimization and mapping to specialized hardware accelerators.
Gus Henry Smith +7 more
semanticscholar +1 more source
Termination of Cycle Rewriting by Transformation and Matrix Interpretation [PDF]
Logical Methods in Computer Science, 2017 We present techniques to prove termination of cycle rewriting, that is, string rewriting on cycles, which are strings in which the start and end are connected.
David Sabel, Hans Zantema
doaj +1 more source
Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 A proof tableau of Hoare logic is an annotated program with pre- and post-conditions, which corresponds to an inference tree of Hoare logic. In this paper, we show that a proof tableau for partial correctness can be transformed into an inference sequence
Shinnosuke Mizutani, Naoki Nishida
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
Rewrite, rewrite, rewrite, rewrite, rewrite...
Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89, 1989 The theory of term rewriting systems has important applications in abstract data type specifications and functional programming languages. We begin here a study of properties of systems that are not necessarily terminating, but allow for infinite derivations that have a limit.
N. Dershowitz, S. Kaplan
openaire +2 more sources
Rewrite, rewrite, rewrite, rewrite, rewrite, …
Theoretical Computer Science, 1991 We study properties of rewrite systems that are not necessarily terminating, but allow instead for transfinite derivations that have a limit. In particular, we give conditions for the existence of a limit and for its uniqueness and relate the operational and algebraic semantics of infinitary theories.
Dershowitz, Nachum +2 more
openaire +1 more source
Modularity of Convergence and Strong Convergence in Infinitary Rewriting [PDF]
Logical Methods in Computer Science, 2010 Properties of Term Rewriting Systems are called modular iff they are preserved under (and reflected by) disjoint union, i.e. when combining two Term Rewriting Systems with disjoint signatures.
Stefan Michael Kahrs
doaj +1 more source