Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 18 of 18 for “"Term Rewriting"”.
-
Term rewriting system models of modern microprocessors
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
-
The DP framework for proving termination of term rewriting
Termination is the fundamental property of a program that for each input, the evaluation will eventually stop and return some output. Although the question whether a given program terminates is undecidable, many techniques have been developed which can be used to answer the question of termination …
-
Incorporating equation solving into unification through stratified term rewriting
… unification and describes STAR, a stratified term rewriting system that achieves a full integration. STAR is an advance over existing systems because it integrates an equational theory with unification at a lower, more fundamental level. Certain properties of STAR are proven including …
-
Term rewriting with built-in numbers and collection data structures
Term rewrite systems have been extensively used in order to model computer programs for the purpose of formal verification. This is in particular true if the termination behavior of computer programs is investigated, and automatic termination proving for term rewrite systems has received increased …
-
Applications of Homological Algebra to Equational Theories
… original axioms. However, it is not easy to determine if a given set of axioms is the smallest or not. Malbos and Mimram investigated a general method to find a lower bound of the cardinality of the set of equational axioms (or rewrite rules) that is equivalent to a given equational theory (or …
-
Strategic Modelling with Graph Rewriting Tools
… and convey intuitions or ideas about it. Graph rewriting rules can be used to model their dynamic evolution and from a practical point of view, graph transformations have many applications in specification, programming, and simulation tools. Strategic rewriting has been studied for term …
-
Learning how to solve linear equations by teaching the computer: Development and formative evaluation
… matter. Linear Kid is designed by employing a term-rewriting system based on a production system architecture. To provide user feedback, the system matches the student's responses with the correct rules of an expert by adopting a simplified version of an overlay model as a student model.
-
Lightweight Formal Methods for Correct, Efficient Systems Programming
… The Diospyros compiler combines an efficient term-rewriting strategy, equality saturation, with translation validation to find correct, fast vectorizations for specialized linear algebra tasks on digital signal processors. The Kani verifier for Rust leverages compiler invariants to improve the …
-
Toward automatic programming
… are expressed as formal rules in a term rewriting language with contexts, and they are inferred from examples via a novel anti-unification algorithm. For evaluation, we use the technique to successfully infer 15 JavaScript linting rules. Second, we give a technique for searching …
-
Learning companion systems
… for both the companion and the teacher is a term rewriting system. Finally, the disadvantages of my design of the prototype and LCS in general, and the future directions of LCS related research are discussed.
-
Rapid designs for cache coherence protocol engines in Bluespec
… which is a high level hardware language based on Term Rewriting Systems (TRSs). The framework is highly parameterized and general, thus allowing designers to design any protocol engine in a short period. Since protocol engines can be developed rapidly, designers can compare different designs …
-
Circular Reasoner: A package in Mathematica for the execution of certain otherwise non-terminating functional programs
… of initial guesses of final values for relevant terms, arrives at a value consistent with the equations used to define the functional program. We discuss this package and its implementation.
-
SAT encodings: from constraint based termination analysis to circuit synthesis
Termination is one of the most prominent undecidable problems in computer science. At the same time, the problem whether a given program terminates for all inputs is sufficiently important for the area of program verification to spur decades-long efforts in developing sufficient criteria for …
-
A modular rewriting approach to language design, evolution and analysis
… that takes advantage of the strengths of rewriting logic and term rewriting techniques. Although currently specific to K, parts of this module system are also aimed at other formalisms, with the goal of providing a reuse mechanism for different forms of modular semantics in the future. …
-
Homotopy Theory of Monoids and Group Completion
… the connection of ω-groupoids with the theory of rewriting for presentations of monoids to calculate the second homotopy group of the classifying space BM of a monoid M in terms of a chosen presentation by generators and relations.
-
Autocatalytic closure and the evolution of cellular information processing networks
… Artificial Chemistry (AC) which employs a term rewriting system called the Molecular Classifier System (MCS.bl). The latter is derived from the Holland broadcast language formalism. Our first series of experiments focuses on the emergence and evolution of selfmaintaining molecular …
-
Sparse and Structured Tensor Programming
… x∗0 = 0, which motivates sparsity) with simple term rewriting. Building on looplets, we introduce a new language, Finch, for general structured tensor programming. Finch makes it easier to compute with structured tensors by combining program control flow and tensor structures into a common …
-
Automatic presentations of infinite structures
… automatic presentations can be recast in logical terms using various notions of interpretations. The simplicity and robustness of the model coupled with the diversity of automatic structures makes automatic presentations interesting subject of investigation within the scope of algorithmic model …