Results 11 to 20 of about 321,292 (267)
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
Journal of Philosophical Investigations, 2023 Two traps currently ensnare Heideggerian scholarship: the “language trap” and the “being trap”. To avoid them, the text argues we should follow Heidegger’s important indication that movement (aka ex-sistential becoming or Zeit) determines all forms of ...
Thomas Sheehan
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
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
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
RNA-Editing with Combined Insertion and Deletion Preserves Regularity [PDF]
Scientific Annals of Computer Science, 2013 We consider two elementary forms of string rewriting called guided insertion/deletion and guided rewriting. The original strings are modified depending on the match with a given set of auxiliary strings, called guides. Guided insertion/deletion considers
E.P. de Vink, H. Zantema, D. Bošnački
doaj +1 more source
Thermodynamic graph-rewriting [PDF]
Logical Methods in Computer Science, 2013 We develop a new thermodynamic approach to stochastic graph-rewriting. The ingredients are a finite set of reversible graph-rewriting rules called generating rules, a finite set of connected graphs P called energy patterns and an energy cost function. The idea is that the generators define the qualitative dynamics, by showing which transformations are ...
Danos, Vincent +3 more
openaire +9 more sources
The Effect of Operating Temperature on the Response Time of Optically Driven Liquid Crystal Displays
Crystals, 2020 Optically driven liquid crystal displays (ODLCDs) realizes their display function by tuning the easy axis of liquid crystal (LC) molecules under polarized blue light, which has been utilized in some optical devices due to its advantages of ultra-low ...
Vladimir Chigrinov +4 more
doaj +1 more source
Towards 3-Dimensional Rewriting Theory [PDF]
Logical Methods in Computer Science, 2014 String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of monoids, allowing computations on those and their manipulation by a computer.
Samuel Mimram
doaj +1 more source