Award type：Award from Japanese society, conference, symposium, etc.  Country：Japan

Award type：Award from Japanese society, conference, symposium, etc.  Country：Japan

Authorship：Last author,　Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

In the last decade, several transformations of an imperative program into a logically constrained term rewrite system (LCTRS, for short) have been investigated and extended. They do not preserve the nesting of statements, generating rewrite rules like transition systems, while function calls are represented by the nesting of function symbols. Structural features of the original program must be often useful in analyzing the transformed LCTRS, but, to use such features, we have to know how to transform the program into the LCTRS, e.g., we keep the correspondence between statements in the program and the introduced auxiliary function symbols in the LCTRS. In this paper, we propose a nesting-preserving transformation of a SIMP program (a C integer program) into an LCTRS. The transformation is almost based on previous work and introduces the nesting of function symbols that correspond to statements in the original program. To be more precise, we propose a construction of a tree homomorphism which is used as a post-process of the transformation in previous work, i.e., which is applied to the LCTRS obtained from the program. As a correctness of the nesting-preserving transformation, we show that the tree homomorphism is sound and complete for the reduction of the LCTRS.

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

Logically constrained term rewrite systems with the bit-vector theory (BV-LCTRSs, for short) are useful as models of programs written in C or other languages. During a process of Rewriting Induction for equivalence verification, we need to frequently prove termination of rewrite systems obtained by adding rewriting rules for induction hypotheses into a given rewrite system. As for term rewrite systems, the dependency pair (DP, for short) framework is used for proving termination of LCTRSs, and several kinds of DP processors are used in the framework. However, the polynomial interpretation processor, one of the most powerful processors in proving termination of LCTRSs with the integer theory, is not applicable to BV-LCTRSs. In this article, we aim at enhancing the power of proving termination of BV-LCTRSs. To this end, we propose the polynomial interpretation processor over bit-vectors and the single self-looping elimination processor as new DP processors for BV-LCTRSs.

Authorship：Last author,　Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Springer, Cham  

An all-path reachability problem of a logically constrained term rewrite system is a pair of constrained terms representing state sets, and is demonically valid if every finite execution path from any state in the first set to a terminating state includes a state in the second set. We have proposed a framework to reduce the non-occurrence of specified error states in a transition system represented by a logically constrained term rewrite system to an all-path reachability problem of the system. In this paper, we extend the framework to verification of starvation freedom of asynchronous integer transition systems with shared variables such that some processes enter critical sections.

DOI： 10.1007/978-3-031-24841-2_11

Authorship：Lead author,　Corresponding author   Language：English   Publishing type：Research paper (conference, symposium, etc.)  

Language：English   Publishing type：Research paper (conference, symposium, etc.)  

Authorship：Lead author,　Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

To transform an imperative program into a logically constrained term rewrite system (LCTRS, for short), previous work converts a statement list to rewrite rules in a stepwise manner, and proves the correctness along such a conversion and the big-step semantics of the program. On the other hand, the small-step semantics of a programming language comprises of inference rules that define transition steps of configurations. Partial instances of such inference rules are almost the same as rewrite rules in the transformed LCTRS. In this paper, we aim at establishing a framework for plain definitions and correctness proofs of transformations from programs into LCTRSs. To this end, for the transformation in previous work, we show an injective function from configurations to terms, and reformulate the transformation by means of the injective function. The injective function maps a transition step to a reduction step, and results in a plain correctness proof.

Authorship：Last author,　Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

A concurrent program with semaphore-based exclusive control can be transformed into a logically constrained term rewrite system that is computationally equivalent to the program. In this paper, we first propose a framework to reduce the non-occurrence of a specified runtime error in the program to an all-path reachability problem of the transformed logically constrained term rewrite system. Here, an all-path reachability problem is a pair of state sets and is true if every finite execution path starting with a state in the first set and ending with a terminating state includes a state in the second set. Then, as a case study, we show how to apply the framework to the race-freeness of semaphore-based exclusive control in the program. Finally, we show a simplified variant of a proof system for all-path reachability problems.

Authorship：Last author,　Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

A GSC-terminating and orthogonal inductive definition set (IDS, for short) of first-order predicate logic can be transformed into a many-sorted term rewrite system (TRS, for short) such that a quantifier-free sequent is valid w.r.t. the IDS if and only if a term equation representing the sequent is an inductive theorem of the TRS. Under certain assumptions, it has been shown that a quantifier- and cut-free cyclic proof of a sequent can be transformed into a rewriting-induction (RI, for short) proof of the corresponding term equation. The RI proof can be transformed back into the cyclic proof, but it is not known how to transform arbitrary RI proofs into cyclic proofs. In this paper, we show that for a quantifier- and logical-connective-free sequent, if there exists an RI proof of the corresponding term equation, then there exists a cyclic proof of some sequent w.r.t. some IDS such that the cyclic proof ensures the validity of the initial sequent. To this end, we show a transformation of the RI proof into such a cyclic proof, a sequent, and an IDS.

Authorship：Last author,　Corresponding author   Language：English   Publishing type：Research paper (scientific journal)  

In this paper, we transform an orthogonal inductive definition set, which is a set of productions for inductive predicates, into a confluent term rewrite system such that a quantifier-free sequent is valid w.r.t. the inductive definition set if and only if an equation representing the sequent is an inductive theorem of the term rewrite system. To this end, we first propose a transformation of an orthogonal inductive definition set into a confluent term rewrite system that is equivalent to the inductive definition set in the sense of evaluating ground formulas. Then, we show that termination of the inductive definition set is proved by the generalized subterm criterion if and only if termination of the transformed term rewrite system is so. Finally, we show that the transformed term rewrite system with some rewrite rules for sequents has the expected property. In addition, we show a termination criterion for the union of term rewrite systems whose termination is proved by the generalized subterm criterion.

DOI： 10.1016/j.jlamp.2022.100779

Authorship：Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Springer  

An inductive definition set (IDS, for short) of first-order predicate logic can be transformed into a many-sorted term rewrite system (TRS, for short) such that a quantifier-free sequent is valid w.r.t. the IDS if and only if a term equation representing the sequent is an inductive theorem of the TRS. In this paper, to compare rewriting induction (RI, for short) with cyclic proof systems, under certain assumptions, we show that if a sequent has a cut- and quantifier-free cyclic proof, then there exists an RI proof for a term equation of the sequent. To this end, we propose a transformation of a cut- and quantifier-free cyclic proof of the sequent into an RI proof for the corresponding equation.

DOI： 10.1007/978-3-030-99461-7_15

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

A method to verify programs written in a simple C-like language via logically constrained term rewrite systems (LCTRS, for short) has been investigated. The method transforms a program into an LCTRS, and reduces properties of the program to those of the transformed LCTRS. In this article, we propose a transformation of LLVM IRs into LCTRSs, aiming at expanding the scope of the method. In the semantics of LLVM IRs, a configuration includes a memory and an assignment as mappings in general. On the other hand, LCTRSs used in the existing work do not deal with such mappings as built-in data, and thus, function symbols keep ranges of memories and assignments as arguments, making the transformation and its correctness proof more complicated. For this reason, we employ LCTRSs that deal with memories and assignments as built-in data, as LLVM IRs do. This makes a correctness proof of our transformation clear. More precisely, we define an injective mapping from configurations to terms. Using the mapping, we propose a transformation that generates a rewrite rule for each instruction in an LLVM IR by instantiating each inference rule of the LLVM-IR semantics which is applicable to the instruction.

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

Authorship：Lead author,　Corresponding author   Language：English   Publishing type：Research paper (scientific journal)  

In a reversible language, any forward computation can be undone by a finite sequence of backward steps. Reversible computing has been studied in the context of different programming languages and formalisms, where it has been used for testing and verifica- tion, among others. In this paper, we consider a subset of Erlang, a functional and concurrent programming language based on the actor model. We present a formal semantics for reversible computation in this language and prove its main properties, including its causal consistency. We also build on top of it a rollback operator that can be used to undo the actions of a process up to a given checkpoint.

DOI： 10.1016/j.jlamp.2021.100688

Other Link： http://hdl.handle.net/2237/0002001914

Language：English   Publishing type：Research paper (conference, symposium, etc.)  

Authorship：Lead author,　Corresponding author   Language：English   Publishing type：Research paper (conference, symposium, etc.)  

Authorship：Last author,　Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

In this paper, we transform an inductive definition set—a set of productions for inductive predicates—into a term rewrite system (TRS, for short) such that a quantifier-free sequent over the first-order logic with the inductive definition set is valid if and only if its corresponding equation is an inductive theorem of the TRS. The resulting TRS is composed of three parts: Rewrite rules for logical connectives and a binary symbol for sequents; rewrite rules for productions; rewrite rules for the co-patterns of the second part. For correctness of the resulting TRS, we assume a certain property of the inductive definition set, which is a sufficient condition for ground termination and ground confluence of the resulting TRS. The transformation aims at comparing cyclic proof systems and rewriting induction.

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

Language：Japanese  

The authors have proposed a solver CombSQL+ for combinatorial optimization problems (COPs) described in extended SQL language. The system generates QFLIA constraints by executing an SQL query transformed from an input description, and then solves them by an SMT solver. This report proposes an improvement of the system to generate constraints in pseudo-Boolean forms if possible. We report that the enhancement accelerates more than seven times faster for a problem.

Language：English   Publishing type：Research paper (scientific journal)  

Reversibility enables a program to be executed both forwards and backwards. This ability allows programmers to backtrack the execution to a previous state. This is essential if the computation is not deterministic because re-running the program forwards may not lead to that state of interest. Reversibility of sequential programs has been well studied and a strong theoretical basis exists. Contrarily, reversibility of concurrent programs is still very young, especially in the practical side. For instance, in the particular case of the Communicating Sequential Processes (CSP) language, reversibility is practically missing. In this article, we present a new technique, including its formal definition and its implementation, to reverse CSP computations. Most of the ideas presented can be directly applied to other concurrent specification languages such as Promela or CCS, but we center the discussion and the implementation on CSP. The technique proposes different forms of reversibility, including strict reversibility and causal-consistent reversibility. On the practical side, we provide an implementation of a system to reverse CSP computations that is able to highlight the source code that is being executed in each forwards/backwards computation step, and that has been optimized to be scalable to real systems.

DOI： 10.1109/TPDS.2021.3051747

Language：English  

This paper presents reverCSP, a tool to animate both forward and backward CSP computations. This ability to reverse computations can be done step by step or backtracking to a given desired state of interest. reverCSP allows us to reverse computations exactly in the same order in which they happened, or also in a causally-consistent way. Therefore, reverCSP is a tool that can be especially useful to comprehend, analyze, and debug computations. reverCSP is an open-source project publicly available for the community. We describe the tool and its functionality, and we provide implementation details so that it can be reimplemented for other languages.

DOI： 10.1007/978-3-030-52482-1_14

Language：English   Publishing type：Research paper (conference, symposium, etc.)  

Authorship：Lead author,　Corresponding author   Language：English   Publishing type：Research paper (conference, symposium, etc.)  

Language：English   Publishing type：Research paper (international conference proceedings)  

Language：English   Publishing type：Research paper (scientific journal)  

Reversible computing allows one to run programs not only in the usual forward direction, but also backward. A main application area for reversible computing is debugging, where one can use reversibility to go backward from a visible misbehaviour towards the bug causing it. While reversible debugging of sequential systems is well understood, reversible debugging of concurrent and distributed systems is less settled. We present here two approaches for debugging concurrent programs, one based on backtracking, which undoes actions in reverse order of execution, and one based on causal consistency, which allows one to undo any action provided that its consequences, if any, are undone beforehand. The first approach tackles an imperative language with shared memory, while the second one considers a core of the functional message-passing language Erlang. Both the approaches are based on solid formal foundations.

DOI： 10.1007/978-3-030-47361-7_5

Language：Japanese  

To apply Logically Constrained Term Rewrite Systems (LCTRSs, for short) to program verification, a previous work targets programs that are executed sequentially. Considering actual usage of computers, it has been expected to develop a verification method for equivalence between sequentially executed programs and their concurrent versions. In this paper, we propose a transformation of programs with exclusive control based on semaphores into LCTRSs, aiming at modeling concurrent programs by LCTRSs. To this end, we first expand arguments of a function symbol that has been introduced to represent a configuration of sequential execution, so as to store all executed processes. Next, we show how to represent operations for semaphores by rewrite rules, and show a transformation of programs with exclusive control based on semaphores into LCTRSs. We manage waiting lists for semaphores by means of number checks, avoiding recursive data structures such as lists.

Language：Japanese  

In this paper, we extend rewriting induction which is developed to prove equations, to existentially quantified equations. More precisely, we first introduce existentially quantified terms into right-hand sides of rules in logically constrained term rewrite systems. Then, we formulate existentially quantified equations and extend rewriting induction for existentially quantified equations. Finally, we present an proof of inequalities by reducing them to existentially quantified equations and applying the extended rewriting induction.

Authorship：Lead author   Language：English  

Language：English  

Given a function that takes a source data and returns a view, bidirectionalization aims at producing automatically a new function that takes a modified view and returns the corresponding, modified source. In this paper, we consider simple first-order functional programs specified by (conditional) term rewrite systems. Then, we present a bidirectionalization technique based on the injectivization and inversion transformations from. We also prove a number of relevant properties which ensure that changes in both the source and the view are correctly propagated and that no undesirable side-effects are introduced. Furthermore, we introduce the use of narrowing---an extension of rewriting that replaces matching with unification---to precisely characterize compatible (also called in-place) view updates so that the resulting bidirectional transformations are well defined. Finally, we discuss some directions for dealing with view updates that are not compatible.

DOI： 10.1007/978-3-030-21500-2_5

Authorship：Lead author   Language：English  

In this paper, we propose a determinization method of inverted grammar programs by means of context-free expressions which are straightforward extensions of regular expressions to context-free languages. Grammar programs are context-free grammars that an inversion method proposed by Glueck and Kawabe uses as intermediate results. We use conditional term rewriting systems (CTRSs, for short) as target programs, and our determinization method aims at transforming a given CTRS into a non-overlapping one that is semantically equivalent to the given one. To this end, we first translate a grammar program into an equivalent context-free expression. Then, by using some simple equalities of expressions, we transform the expression to a desired form. Finally, we translate the resulting expression back into an equivalent grammar program which can be translated back into a non-overlapping CTRS.

Language：English  

In this paper, we aim at formalizing a transformation of an IMP program into a logically constrained term rewriting system (LCTRS, for short) in Isabelle/HOL. To this end, we formalize LCTRSs and the transformation in Isabelle/HOL.

Language：English   Publishing type：Research paper (scientific journal)  

We prove equivalence of imperative programs by an automatic conversion of the functions in the input program to an equivalent Logically Constrained Term Rewrite System (LCTRS), followed by constrained rewriting induction (either fully automatically or guided by the user) to analyze equivalence of the corresponding functions in the LCTRS. Our approach is implemented in the tool Ctrl.

Language：Japanese  

The authors recently proposed an SQL-based language CombSQL+ for specifying combinatorial optimization problems, and showed a solving method that uses an SMT solver. This method has an advantage that problem constraints are written in ordinary SQL queries, and hence it enables us an intuitive specification. In order to generate constraints to be solved by an SMT solver from a specification, it uses SQL queries extended for constrained tables, each of which represents a set of tables. Current extended queries, however, does not cover full-SQL query facilities, hence for this we need to develop a complex SQL-engine for constrained tables. This paper proposes a generation method of an ordinary SQL query, whose execution by an existing SQL-engine causes constraints for SMT solvers. Here, a key technique is the use of user-definable functions that may cause side-effects allowed in the database system SQLite.

Language：English  

In this paper, we show a new approach to transformations of an imperative program with function calls and global variables into a logically constrained term rewriting system. The resulting system represents transitions of the whole execution environment with a call stack. More precisely, we prepare a function symbol for the whole environment, which stores values for global variables and a call stack as its arguments. For a function call, we prepare rewrite rules to push the frame to the stack and to pop it after the execution. Any running frame is located at the top of the stack, and statements accessing global variables are represented by rewrite rules for the environment symbol. We show a precise transformation based on the approach and prove its correctness.

DOI： 10.4204/EPTCS.289.3

arXiv

Language：English  

The grammar representation of a narrowing tree for a syntactically deterministic conditional term rewriting system and a pair of terms is a regular tree grammar that generates expressions for substitutions obtained by all possible innermost-narrowing derivations that start with the pair and end with particular non-narrowable terms. In this paper, under a certain syntactic condition, we show a transformation of the grammar representation of a narrowing tree into another regular tree grammar that overapproximately generates the ranges of ground substitutions generated by the grammar representation. In our previous work, such a transformation is restricted to the ranges w.r.t. a given single variable, and thus, the usefulness is limited. We extend the previous transformation by representing the range of a ground substitution as a tuple of terms, which is obtained by the coding for finite trees. We show a precise definition of the transformation and prove that the language of the transformed regular tree grammar is an overapproximation of the ranges of ground substitutions generated by the grammar representation. We leave an experiment to evaluate the usefulness of the transformation as future work.

DOI： 10.4204/EPTCS.289.35

arXiv

Language：Japanese  

Recently, several methods for verifying imperative programs by means of transformations into term rewriting systems have been investigated. In particular, constrained rewriting systems are popular as sources of such transformations, since logical constraints used for modeling control flows can be separated from terms that represent intermediate states of the execution of target programs.In the existing methods, data types that can be used in target programs are, however, restricted to the integers and their one-dimensional arrays, and hence we are not allowed to use other primitive data types, structures, or unions.In this article, we propose a bit-vector representation of basic data types that are recursively defined over size-fixed primitive data types, structure, and unions in the framework of logically constrained rewriting, and then propose a construction of rewrite rules that access members of structures and unions.

Language：Japanese  

Language：English  

Logically constrained rewrite systems constitute a very general rewriting formalism that can capture simplification processes in various domains as well as computation in imperative programs. In both of these contexts, nontermination is a critical source of errors. We present new criteria to find loops in logically constrained rewrite systems which are implemented in the tool Ctrl. We illustrate the usefulness of these criteria in three example applications: to find loops in LLVM peephole optimizations, to detect looping program executions of C programs, and to establish nontermination of integer transition systems.

DOI： 10.1007/978-3-030-03592-1_18

Language：English   Publishing type：Research paper (scientific journal)  

In a reversible language, any forward computation can be undone by a finite sequence of backward steps. Reversible computing has been studied in the context of different programming languages and formalisms, where it has been used for testing and verifica- tion, among others. In this paper, we consider a subset of Erlang, a functional and concurrent programming language based on the actor model. We present a formal semantics for reversible computation in this language and prove its main properties, including its causal consistency. We also build on top of it a rollback operator that can be used to undo the actions of a process up to a given checkpoint.

DOI： 10.1016/j.jlamp.2018.06.004

Language：Japanese  

Language：Japanese  

Authorship：Lead author   Language：English  

Unravelings, which are transformations of a conditional term rewriting system (CTRS, for short) into an unconditional term rewriting system (TRS, for short), are useful to prove confluence and operational termination of some CTRSs. A simultaneous unraveling has been proposed for normal 1-CTRSs and a sequential one has been proposed for deterministic 3-CTRSs, the class of which includes normal 1-CTRSs. In this paper, we first show that for a normal 1-CTRS, the simultaneously unraveled TRS is orthogonal iff so is the sequentially unraveled one. Then, we show that for a normal 1-CTRS, if the simultaneously unraveled TRS is terminating, then so is the sequentially unraveled one. Finally, we show that for a normal 1-CTRS with termination of the unraveled TRS, the simultaneously unraveled TRS is locally confluent iff so is the sequentially unraveled one.

Authorship：Lead author   Language：English  

Authorship：Lead author   Language：English  

A narrowing tree for a constructor term rewriting system and a pair of terms is a finite representation for the space of all possible innermost-narrowing derivations that start with the pair and end with non-narrowable terms. Narrowing trees have grammar representations that can be considered regular tree grammars. Innermost narrowing is a counterpart of constructor-based rewriting, and thus, narrowing trees can be used in analyzing constructor-based rewriting to normal forms. In this paper, using grammar representations, we extend narrowing trees to syntactically deterministic conditional term rewriting systems that are constructor systems. We show that narrowing trees are useful to prove two properties of a normal conditional term rewriting system: one is infeasibility of conditional critical pairs and the other is quasi-reducibility.

DOI： 10.4230/LIPIcs.FSCD.2018.26

Authorship：Lead author   Language：English  

We report on the 2018 edition of the Confluence Competition, a competition of software tools that aim to (dis)prove confluence and related properties of rewrite systems automatically.

DOI： 10.4230/LIPIcs.FSCD.2018.32

Language：English  

Programming languages based on the actor model, such as Erlang, avoid some concurrency bugs by design. However, other concurrency bugs, such as message order violations and livelocks, can still show up in programs. These hard-to-find bugs can be more easily detected by using causal-consistent reversible debugging, a debugging technique that allows one to traverse a computation both forward and backward. Most notably, causal consistency implies that, when going backward, an action can only be undone provided that its consequences, if any, have been undone beforehand. To the best of our knowledge, we present the first causal-consistent reversible debugger for Erlang, which may help programmers to detect and fix various kinds of bugs, including message order violations and livelocks.

DOI： 10.1007/978-3-319-90686-7_16

Language：English   Publishing type：Research paper (scientific journal)  

Rewriting induction (RI) frameworks consist of inference rules to prove equations to be inductive theorems of a given term rewriting system, i.e., to be inductively valid w.r.t. reduction of the given system. To prove inductive validity of inequalities within such frameworks, one may reduce inequalities to equations. However, it is often hard to prove inductive validity of such reduced equations within the existing RI frameworks due to their indirect handling of inequalities. In this paper, we adapt the notion of inductive theorems to inequalities and propose an RI framework for directly proving inductive validity of inequalities of constrained term rewriting systems. Direct handling of inequalities enables us to utilize transitivity of binary predicates via application of induction hypotheses. Our framework succeeds in proving inductive validity of some inequalities that are hard to verify within the existing RI frameworks for equations. For the sake of automated reasoning, we provide a strategy for applying inference rules and evaluate its performance by means of an implementation.

DOI： 10.1016/j.scico.2017.10.012

Language：English  

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 of rewriting induction for constrained rewriting. We also show that the resulting sequence is a valid proof for an inductive theorem corresponding to the Hoare triple if the constrained rewriting system obtained from the program is terminating. Such a valid proof with termination of the constrained rewriting system implies total correctness of the program w.r.t. the Hoare triple. The transformation enables us to apply techniques for proving termination of constrained rewriting to proving total correctness of programs together with proof tableaux for partial correctness.

DOI： 10.4204/EPTCS.265.4

Language：English  

In the dependency pair framework for proving termination of rewriting systems, polynomial interpretations are used to transform dependency chains into bounded decreasing sequences of integers, and they play an important role for the success of proving termination, especially for constrained rewriting systems. In this paper, we show sufficient conditions of linear polynomial interpretations for transforming dependency chains into bounded monotone (i.e., decreasing or increasing) sequences of integers. Such polynomial interpretations transform rewrite sequences of the original system into decreasing or increasing sequences independently of the transformation of dependency chains. When we transform rewrite sequences into increasing sequences, polynomial interpretations have non-positive coefficients for reducible positions of marked function symbols. We propose four DP processors parameterized by transforming dependency chains and rewrite sequences into either decreasing or increasing sequences of integers, respectively. We show that such polynomial interpretations make us succeed in proving termination of the McCarthy 91 function over the integers.

DOI： 10.4204/EPTCS.265.7

Language：English   Publishing type：Research paper (scientific journal)  

Essentially, in a reversible programming language, for each forward computation from state S to state S', there exists a constructive method to go backwards from state S' to state S. Besides its theoretical interest, reversible computation is a fundamental concept which is relevant in many different areas like cellular automata, bidirectional program transformation, or quantum computing, to name a few.

In this work, we focus on term rewriting, a computation model that underlies most rule-based programming languages. In general, term rewriting is not reversible, even for injective functions; namely, given a rewrite step t1 -> t2, we do not always have a decidable method to get t1 from t2. Here, we introduce a conservative extension of term rewriting that becomes reversible. Furthermore, we also define two transformations, injectivization and inversion, to make a rewrite system reversible using standard term rewriting. We illustrate the usefulness of our transformations in the context of bidirectional program transformation.

DOI： 10.1016/j.jlamp.2017.10.003

Authorship：Lead author   Language：English  

Authorship：Lead author   Language：English  

In a reversible language, any forward computation can be undone by a finite sequence of backward steps. Reversible computing has been studied in the context of different programming languages and formalisms, where it has been used for debugging and for enforcing fault-tolerance, among others. In this paper, we consider a subset of Erlang, a concurrent language based on the actor model, and formally introduce a semantics for reversible computation. To the best of our knowledge, this is the first attempt to define a reversible semantics for Erlang.

DOI： 10.1007/978-3-319-63139-4_15

Language：Japanese  

Malbolge is an esoteric programming language, which is promising to protect intellectual property rights due to its difficulty of analysis. It is, however, very difficult to program because of its peculiar instructions. Tackling this problem, pseudo-instruction sequences was developed as an intermediate language for generating Malbolge programs. Nevertheless it is still difficult to program compared with ordinary languages like C. In this article, we present how to implement a compiler that translates to Malbolge from a C-language subset containing the integer type, the Boolean type, basic control structures such as while statement, and recursive calls. In the implementation, we firstly added array syntax and function syntax to pseudo-instruction sequences, and strengthen existing tools for the extention to conform with it. We next propose a translation method from C-language subset to pseudo-instruction sequences.

Language：Japanese  

In dependency pair framework for proving termination of constrained term rewriting systems, polynomial interpretations that transform dependency chains representing sequences of relevant function calls into bounded decreasing sequences of integers play an important role for the success of proving termination. In this article, we propose polynomial interpretations that transform dependency chains into bounded decreasing sequences but transform rewrite sequences of the original system into increasing sequences.We also propose polynomial interpretations that transform dependency chains into bounded increasing sequences of integers.
We report empirical comparison results between the proposed polynomial interpretations.

Language：English   Publishing type：Research paper (scientific journal)  

This article aims to develop a verification method for procedural programs via a transformation into logically constrained term rewriting systems (LCTRSs). To this end, we extend transformation methods based on integer term rewriting systems to handle arbitrary data types, global variables, function calls, and arrays, and to encode safety checks. Then we adapt existing rewriting induction methods to LCTRSs and propose a simple yet effective method to generalize equations. We show that we can automatically verify memory safety and prove correctness of realistic functions. Our approach proves equivalence between two implementations; thus, in contrast to other works, we do not require an explicit specification in a separate specification language.

DOI： 10.1145/3060143

Language：Japanese  

A transformational approach to confluence proofs for conditional term rewriting systems (CTRS) has been investigated, but confluence of a CTRS defining sorting over natural numbers has not been proved yet by any existing confluence prover. Such a CTRS defines behavior of function symbols hierarchically, called a hierarchical CTRS, and is not sufficiently complete. In this article, we propose a method to prove confluence of hierarchical CTRSs that are not sufficiently complete. More precisely, we first extend rewriting induction for conditional equations to TRSs that are not sufficiently complete, and then we prove joinability of a conditional critical pair by inducing other conditions from the original conditional part. Next, we design a simplification order that takes conditional parts of rewrite rules into account, and propose a method to prove termination of hierarchical CTRSs by means of the designed simplification order.

Language：English   Publishing type：Research paper (scientific journal)  

A term rewrite system is terminating when no infinite reduction sequences are possible. Relative termination generalizes termination by permitting infinite reductions as long as some distinguished rules are not applied infinitely many times. Relative termination is thus a fundamental notion that has been used in a number of different contexts, like analyzing the confluence of rewrite systems or the termination of narrowing. In this work, we introduce a novel technique to prove relative termination by reducing it to dependency pair problems. To the best of our knowledge, this is the first significant contribution to Problem #106 of the RTA List of Open Problems. We first present a general approach that is then instantiated to provide a concrete technique for proving relative termination. The practical significance of our method is illustrated by means of an experimental evaluation.

DOI： 10.1007/s10817-016-9373-5

Language：English  

In this paper, we show that the SR transformation, a computationally equivalent transformation proposed by Serbanuta and Rosu, is a sound structure-preserving transformation for weakly-left-linear deterministic conditional term rewriting systems. More precisely, we show that every weakly-left-linear deterministic conditional term rewriting system can be converted to an equivalent weakly-left-linear and ultra-weakly-left-linear deterministic conditional term rewriting system and prove that the SR transformation is sound for weakly-left-linear and ultra-weakly-left-linear deterministic conditional term rewriting systems. Here, soundness for a conditional term rewriting system means that reduction of the transformed unconditional term rewriting system creates no undesired reduction sequence for the conditional system.

DOI： 10.4204/EPTCS.235.5

arXiv

Authorship：Lead author   Language：English  

A structure-preserving transformation proposed by Serbanuta and Rosu for strongly or syntactically deterministic conditional term rewriting systems (SDCTRSs) that are ultra-left-linear has been shown to be applicable to weakly-left-linear (WLL) and ultra-WLL SDCTRSs without any change, and sound for such DCTRSs even if they are not SDCTRSs. In this paper, we show a confluent, WLL, and ultra-WLL DCTRS that is not an SDCTRS such that the transformed TRS is not confluent. We also show that for a WLL and ultra-WLL SDCTRS, if the transformed TRS is confluent, then so is the SDCTRS.

Authorship：Lead author   Language：English  

Language：English   Publishing type：Research paper (scientific journal)  

Rewriting induction (RI) frameworks consist of inference rules to prove equations to be inductive theorems of a given term rewriting system, i.e., to be inductively valid w.r.t. reduction of the given system. To prove inductive validity of inequalities within such frameworks, one may reduce inequalities to equations. However, it is often hard to prove inductive validity of such reduced equations within the existing RI frameworks due to their indirect handling of inequalities. In this paper, we adapt the notion of inductive theorems to inequalities and propose an RI framework for directly proving inductive validity of inequalities of constrained term rewriting systems. Within the framework, we handle inequalities that may contain function symbols defined in a given rewriting system but not necessarily interpreted by the built-in semantics. Direct handling of inequalities facilitates the utilization of transitivity of magnitude relations via inequalities obtained as induction hypotheses. Our approach succeeds in proving inductive validity of some inequalities that are hard to verify within the existing RI frameworks for equations.

DOI： 10.1145/2967973.2968598

Language：Japanese  

Language：English  

Essentially, in a reversible programming language, for each forward computation step from state S to state S', there exists a constructive and deterministic method to go backwards from state S' to state S. Besides its theoretical interest, reversible computation is a fundamental concept which is relevant in many different areas like cellular automata, bidirectional program transformation, or quantum computing, to name a few. In this paper, we focus on term rewriting, a computation model that underlies most rule-based programming languages. In general, term rewriting is not reversible, even for injective functions; namely, given a rewrite step t1 -> t2, we do not always have a decidable and deterministic method to get t1 from t2. Here, we introduce a conservative extension of term rewriting that becomes reversible. Furthermore, we also define a transformation to make a rewrite system reversible using standard term rewriting.

DOI： 10.4230/LIPIcs.FSCD.2016.28

Language：English  

A computation is considered reversible if, for each step from state S to state S', there exists a deterministic and terminating method to compute S back from S'. Reversibilization aims at producing a reversible version of an originally irreversible computation principle. Recently, we have introduced a reversible extension of term rewriting. Furthermore, we have defined an appropriate reversibilization transformation for rewrite systems so that standard rewriting becomes reversible on the transformed systems. In this paper, we focus on the potential applications of the reversibilization transformation. In particular, we show its application in the context of bidirectional program transformation and the reversibilization of cellular automata.

Language：Japanese  

Language：Japanese  

The performance of satisfiability (SAT) solvers have incredibly improved in recent years. It is, however, difficult to design appropriate translators for solving combinatorial optimization problems by SAT-solvers. This paper proposes a description language for some combinatorial optimization problems by extending the syntax of the database query language SQL in order to enable their easy descriptions, and discusses a coding scheme of a problem specified by the language into a formula for SAT-solvers.

Language：Japanese  

To generate loop invariants, methods that, using Farkas' lemma, convert verification formulas obtained from a given template, a pre-condition, and a post-condtion of a program have been investigated. Farkas' lemma transforms formulas consisting of inequalities over linear polynomials into equivalent formulas. This lemma has been extended to deal with polynomials including non-linear monomials that may have function calls, and some examples that the extended Farkas' lemma succeeds in generating loop invariants having non-linear polynomials have been shown. However, it has not been discussed how useful the extended lemma is in verifying programs. In this paper, we evaluate the usefulness of a loop-invariant generation based on the extended Farkas' lemma, and propose a verification method that uses the extended lemma effectively. More precisely, using the extended lemma, we transform some of verification formulas that contain unknown coefficients for a given template, into another formula, and then we verify the validity of the formula obtained from the remaining formulas by applying an assignment for the unknown coefficients to satisfy the transformed formula.

Language：Japanese  

The dependency pair framework, a method for proving termination of term rewriting systems, has been extended for constrained term rewriting systems which are extensions of term rewriting systems by allowing rules to have guard constraints. In this paper, by removing one of the side conditions, we improve a narrowing-based transformation of constrained dependency pairs. More precisely, we show that the transformation is sound even if a dependency pair to be converted can form a self-chain such that there is no intermediate derivation.

Language：Japanese  

Language：English  

This paper discusses Ctrl, a tool to analyse - both automatically and manually - term rewriting with logical constraints. Ctrl can be used with TRSs on arbitrary underlying logics, and automatically analyse various properties such as termination, confluence and quasi-reductivity. Ctrl also offers both a manual and automatic mode for equivalence tests using inductive theorem proving, giving support for and verification of "hand-written" term equivalence proofs.

DOI： 10.1007/978-3-662-48899-7_38

Language：Japanese  

Authorship：Lead author   Language：English  

Relative termination, a generalized notion of termination, has been used in a number of different contexts like proving the confluence of rewrite systems or analyzing the termination of narrowing. In this paper, we introduce a new technique to prove relative termination by reducing it to dependency pair problems. To the best of our knowledge, this is the first significant contribution to Problem #106 of the RTA List of Open Problems. The practical significance of our method is illustrated by means of an experimental evaluation.

DOI： 10.1007/978-3-319-21401-6_11

Authorship：Lead author   Language：English  

Language：English  

Confluence is one of the central properties of rewriting. Our competition aims to foster the development of techniques for proving/disproving confluence of various formalisms of rewriting automatically. We explain the background and setup of the 4th Confluence Competition.

DOI： 10.1007/978-3-319-21401-6_5

Language：Japanese  

A constrained term rewriting system, an extension of term rewriting systems, can control application of rules by constraints such as those on integers. By partial elimination of patterns occurring in left-hand sides of rules, which preserves their meanings, one can facilitate analyzing various properties. In this article, we propose a transformation based on pattern elimination of constrained term rewriting systems that contain only patterns of interpretable terms in their left-hand sides, and show sufficient conditions for the resulting system to be equivalent to the original with respect to some properties such as sufficient completeness and innermost termination. We also propose a procedure for testing reduction completeness as an application of the transformation.

Language：Japanese  

Language：Japanese  

Language：English   Publishing type：Research paper (scientific journal)  

The search space of SLD resolution, usually represented by means of a so-called SLD tree, is often infinite. However, there are many applications that must deal with possibly infinite SLD trees, like partial evaluation or some static analyses. In this context, being able to construct a finite representation of an infinite SLD tree becomes useful.

In this work, we introduce a framework to construct a finite data structure representing the (possibly infinite) SLD derivations for a goal. This data structure, called closed SLD tree, is built using four basic operations: unfolding, flattening, splitting, and subsumption. We prove some basic properties for closed SLD trees, namely that both computed answers and calls are preserved. We present a couple of simple strategies for constructing closed SLD trees with different levels of abstraction, together with some examples of its application. Finally, we illustrate the viability of our approach by introducing a test case generator based on exploring closed SLD trees.

DOI： 10.1016/j.jlamp.2014.11.006

Language：Japanese  

Language：Japanese  

Authorship：Lead author   Language：English  

Narrowing basically extends rewriting by allowing free vari- ables in terms and by replacing matching with unification. As a con- sequence, the search space of narrowing becomes usually infinite, as in logic programming. In this paper, we introduce the use of some operators that allow one to always produce a finite data structure that still rep- resents all the narrowing derivations. Furthermore, we extract from this data structure a novel, compact equational representation of the (pos- sibly infinite) answers computed by narrowing for a given initial term. Both the finite data structure and the equational representation of the computed answers might be useful in a number of areas, like program comprehension, static analysis, program transformation, etc.

DOI： 10.1007/978-3-319-14125-1

Authorship：Lead author   Language：English  

This paper aims at developing a verification method for procedural programs via a transformation into logically constrained term rewriting systems (LCTRSs). To this end, we adapt existing rewriting induction methods to LCTRSs and propose a simple yet effective method to generalize equations. We show that we can handle realistic functions, involving, e.g., integers and arrays. An implementation is provided.

DOI： 10.1007/978-3-319-12736-1_18

Language：English  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Authorship：Lead author   Language：English  

Recently, to analyze procedural programs by using techniques in the field of term rewriting, several transformations of a program into a rewrite system have been developed. Such transformations are basically complete in the sense of computation, and e.g., termination of the rewrite system ensures termination of the program. However, in general, termination of the program is not preserved by the transformations and, thus, the preservation of termination is a common interesting problem. In this paper, we discuss the improvement of a transformation from a simple procedural program over integers into a constrained term rewriting system by appending loop invariants to loop conditions of "while" statements so as to preserve termination as much as possible.

Language：English  

Transforming conditional term rewrite systems (CTRSs) into unconditional systems (TRSs) is a common approach to analyze properties of CTRSs via the simpler framework of unconditional rewriting. In the past many different transformations have been introduced for this purpose. One class of transformations, so-called unravelings, have been analyzed extensively in the past. In this paper we provide an overview on another class of transformations that we call structure-preserving transformations. In these transformations the structure of the conditional rule, in particular their left-hand side is preserved in contrast to unravelings. We provide an overview of transformations of this type and define a new transformation that improves previous approaches.

DOI： 10.4230/OASIcs.WPTE.2014.3

Authorship：Lead author   Language：English  

This paper improves the existing criterion for proving confluence of a normal conditional term rewriting system (CTRS) via the Serbanuta-Rosu transformation, a computationally equivalent transformation of CTRSs into unconditional term rewriting systems (TRS), showing that a weakly left-linear normal CTRS is confluent if the transformed TRS is confluent. Then, we discuss usefulness of the optimization of the Serbanuta-Rosu transformation, which has informally been proposed in the literature.

Language：English  

Unfold/fold transformations have been widely studied in various programming paradigms and are used in program transformations, theorem proving, and so on. This paper, by using an example, show that restoring an one-step unfolding is not easy, i.e., a challenging task, since some rules used by unfolding may be lost. We formalize this problem by regarding one-step program transformation as a relation. Next we discuss some issues on a specific framework, called pure-constructor systems, which constitute a subclass of conditional term rewriting systems. We show that the inverse of T preserves rewrite relations if T preserves rewrite relations and the signature. We propose a heuristic procedure to solve the problem, and show its successful examples. We improve the procedure, and show examples for which the improvement takes effect.

DOI： 10.4230/OASIcs.WPTE.2014.27

Authorship：Lead author   Language：English  

In this paper, we show that the SR transformation, a computationally equivalent transformation proposed by Serbanuta and Rosu, is sound for weakly left-linear normal conditional term rewriting systems (CTRS). Here, soundness for a CTRS means that reduction of the transformed unconditional term rewriting system (TRS) creates no undesired reduction for the CTRS. We first show that every reduction sequence of the transformed TRS starting with a term corresponding to the one considered on the CTRS is simulated by the reduction of the TRS obtained by the simultaneous unraveling. Then, we use the fact that the unraveling is sound for weakly left-linear normal CTRSs.

DOI： 10.4230/OASIcs.WPTE.2014.39

Language：Japanese  

Language：Japanese  

Authorship：Lead author   Language：English   Publishing type：Research paper (scientific journal)  

Tail recursive functions are a special kind of recursive functions where the last action in their body is the recursive call. Tail recursion is important for a number of reasons (e.g., they are usually more efficient). In this article, we introduce an automatic transformation of first-order functions into tail recursive form. Functions are defined using a (first-order) term rewrite system. We prove the correctness of the transformation for constructor-based reduction over constructor systems (i.e., typical first-order functional programs).

DOI： 10.1016/j.jlap.2013.07.001

Authorship：Lead author   Language：English  

An inductive theorem proving method for constrained term rewriting systems, which is based on rewriting induction, needs a decision procedure for reduction-completeness of constrained terms. In addition, the sufficient complete property of constrained term rewriting systems enables us to relax the side conditions of some inference rules in the proving method. These two properties can be reduced to intersection emptiness problems related to sets of ground instances for constrained terms. This paper proposes a method to construct deterministic, complete, and constraint-complete constrained tree automata recognizing ground instances of constrained terms.

DOI： 10.4204/EPTCS.134.1

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Authorship：Lead author   Language：English  

Language：Japanese  

Language：English  

Authorship：Lead author   Language：English  

Language：English  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Authorship：Lead author   Language：English   Publishing type：Research paper (scientific journal)  

Unravelings are transformations from a conditional term rewriting system (CTRS, for short) over an original signature into an unconditional term rewriting systems (TRS, for short) over an extended signature. They are not sound w.r.t. reduction for every CTRS, while they are complete w.r.t. reduction. Here, soundness w.r.t. reduction means that every reduction sequence of the corresponding unraveled TRS, of which the initial and end terms are over the original signature, can be simulated by the reduction of the original CTRS. In this paper, we show that an optimized variant of Ohlebusch's unraveling for a deterministic CTRS is sound w.r.t. reduction if the corresponding unraveled TRS is left-linear or both right-linear and non-erasing. We also show that soundness of the variant implies that of Ohlebusch's unraveling. Finally, we show that soundness of Ohlebusch's unraveling is the weakest in soundness of the other unravelings and a transformation, proposed by Serbanuta and Rosu, for (normal) deterministic CTRSs, i.e., soundness of them respectively implies that of Ohlebusch's unraveling.

DOI： 10.2168/LMCS-8(3:4)2012

Language：English  

Authorship：Lead author   Language：English  

Authorship：Lead author   Language：English  

Language：Japanese  

Language：English   Publishing type：Research paper (scientific journal)  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：English   Publishing type：Research paper (scientific journal)  

Language：English  

Language：English  

In this paper, we propose methods for proving termination of constrained term rewriting systems, where constraints are interpreted by built-in semantics given by users, and rewrite rules are assumed to be sound for the interpretation. To this end, we extend the dependency pair framework for proving termination of unconstrained term rewriting systems to constrained term rewriting systems. Moreover, we extend the dependency pair framework so that dependency pair processors take a subgraph of the dependency graph as input and they output a finite set of graphs which can be obtained by eliminating nodes and/or edges from the input graph.

DOI： 10.1007/978-3-642-22531-4_9

Authorship：Lead author   Language：English  

Unravelings are transformations from a conditional term rewriting system (CTRS, for short) over an original signature into an unconditional term rewriting systems (TRS, for short) over an extended signature. They are not sound for every CTRS w.r.t. reduction, while they are complete w.r.t. reduction. Here, soundness w.r.t. reduction means that every reduction sequence of the corresponding unraveled TRS, of which the initial and end terms are over the original signature, can be simulated by the reduction of the original CTRS. In this paper, we show that an optimized variant of Ohlebusch's unraveling for deterministic CTRSs is sound w.r.t. reduction if the corresponding unraveled TRSs are left-linear or both right-linear and non-erasing. We also show that soundness of the variant implies that of Ohlebusch's unraveling.

DOI： 10.4230/LIPIcs.RTA.2011.267

Authorship：Lead author   Language：English  

Program inversion is a fundamental problem that has been addressed in many different programming settings and applications. In the context of term rewriting, several methods already exist for computing the inverse of an injective function. These methods, however, usually return non-terminating inverted functions when the considered function is tail recursive. In this paper, we propose a direct and intuitive approach to the inversion of tail recursive functions. Our new technique is able to produce good results even without the use of an additional post-processing of determinization or completion. Moreover, when combined with a traditional approach to program inversion, it constitutes a promising approach to define a general method for program inversion. Our experimental results confirm that the new technique compares well with previous approaches.

DOI： 10.4230/LIPIcs.RTA.2011.283

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：English   Publishing type：Research paper (scientific journal)  

Language：English  

Authorship：Lead author   Language：English  

Language：Japanese   Publishing type：Research paper (scientific journal)  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：English  

In this extended abstract, we introduce an extension of a previous technique
for proving the termination of narrowing. Basically, given a rewrite system
and an argument filtering, the previous technique required the filtered
program to be free of extra-variables. In this work, we transform the original
rewrite system so that, in some cases (namely when the filtered rewrite system
is left-shallow), termination can still be proved despite the occurrence of
extra-variables in the filtered system.

Language：Japanese  

Language：English   Publishing type：Research paper (scientific journal)  

Authorship：Lead author   Language：English   Publishing type：Research paper (scientific journal)  

Given a constructor term rewriting system that defines injective functions, the inversion compiler proposed
by Nishida, Sakai and Sakabe generates a conditional term rewriting system that defines the inverse relations
of the injective functions, and then the compiler unravels the conditional system into an unconditional term
rewriting system. In general, the resulting unconditional system is not (innermost-)confluent even if the
conditional system is (innermost-)confluent. In this paper, we propose a modification of the Knuth-Bendix
completion procedure, which is used as a post-processor of the inversion compiler. Given a confluent and
operationally terminating conditional system, the procedure takes the resulting unconditional systems as
input. When the procedure halts successfully, it returns convergent systems that are computationally
equivalent to the conditional systems. To adapt the modified procedure to the conditional systems that are
not confluent but innermost-confluent, we propose a simplified variant of the modified procedure. We report
that the implementations of the procedures succeed in generating innermost-convergent inverse systems for
all the examples we tried.

Language：Japanese   Publishing type：Research paper (scientific journal)  

The implicit induction, which is one of induction principles for proving inductive
theorems of equational theories, has been extended to deal with constrained
term rewriting systems. It has been applied to a method for proving equivalence
of imperative programs. In this paper, we extend another induction principle,
the rewriting induction, to cope with the case of constrained term rewriting
systems, and show its correctness. We also propose a method for proving inductive
theorems being based on the extended rewriting induction. Moreover,
we show a technique to disprove inductive theorems.

Language：Japanese  

Language：English  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese   Publishing type：Research paper (scientific journal)  

In the field of procedural programming, several verification methods based
on model checking or Hoare logic have been proposed. On the other hand,
in the field of term rewriting, implicit induction and rewriting induction have
been widely studied as methods for proving inductive theorems. In this paper,
we try to take advantages of methods for proving inductive theorems in verifying
procedural functions written in a "while" language with natural number
type. More precisely, we propose a transformation from procedural programs to
constrained term rewriting systems whose constraints are in Presburger arithmetic,
and show that the transformation reduces the equivalence of procedural
programs to that of functions in rewrite systems. By verifying the equivalence
between rewrite systems, we verify the equivalence between the corresponding
procedural functions. To establish this approach, we extend Critical Pair
Theorem and the basic completion procedure for constrained systems.

Authorship：Lead author   Language：English  

Authorship：Lead author   Language：Japanese  

Language：Japanese  

Language：Japanese   Publishing type：Research paper (scientific journal)  

Language：Japanese  

Language：Japanese  

Language：English  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Authorship：Lead author   Language：English   Publishing type：Research paper (scientific journal)  

Unravelings, transformations from conditional term rewriting systems (CTRSs, for short) into unconditional
term rewriting systems, are valuable for analyzing properties of CTRSs. In order to completely simulate
rewrite sequences of CTRSs, the restriction by a particular context-sensitive and membership condition that
is determined by extra function symbols introduced due to the unravelings, must be imposed on the rewrite
relations of the unraveled CTRSs. In this paper, in order to weaken the context-sensitive and membership
condition, we propose a transformation applied to the unraveled CTRSs, that reduces the number of the
extra symbols. In the transformation, updating the context-sensitive condition properly, we remove the
extra symbols that satisfy a certain condition. If the transformation succeeds in removing all of the extra
symbols, we obtain the TRSs that are computationally equivalent with the original CTRSs.

Language：English  

Authorship：Lead author   Language：English  

Language：Japanese  

Language：English  

Language：English  

Language：Japanese   Publishing type：Research paper (scientific journal)  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Authorship：Lead author   Language：English  

Authorship：Lead author   Language：English  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：English  

Language：Japanese  

Language：Japanese  

Language：Japanese   Publishing type：Research paper (scientific journal)  

Language：Japanese  

Language：Japanese  

Authorship：Lead author   Language：Japanese   Publishing type：Research paper (scientific journal)  

Language：English  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Authorship：Lead author   Language：English  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

Authorship：Lead author   Language：English  

Authorship：Lead author   Language：English  

Authorship：Lead author   Language：Japanese   Publishing type：Research paper (scientific journal)  

Authorship：Lead author   Language：English   Publishing type：Research paper (scientific journal)  

Authorship：Lead author   Language：Japanese   Publishing type：Research paper (scientific journal)  

Authorship：Lead author   Language：Japanese  

Authorship：Lead author   Language：Japanese  

Authorship：Lead author   Language：English  

Authorship：Lead author   Language：Japanese  

Authorship：Lead author   Language：Japanese  

Authorship：Lead author   Language：Japanese  

Authorship：Lead author   Language：Japanese  

Authorship：Lead author   Language：Japanese   Publishing type：Research paper (scientific journal)  

Authorship：Lead author   Language：Japanese  

Authorship：Lead author   Language：English  

Authorship：Lead author   Language：Japanese  

Authorship：Lead author   Language：Japanese  

Authorship：Lead author   Language：Japanese  

Event date： 2022.2

Language：English   Presentation type：Oral presentation (general)  

Venue：hybrid (Nagoya University / onlien)   Country：Japan  

Event date： 2021.9

Language：English   Presentation type：Oral presentation (general)  

Venue：online   Country：Japan  

Event date： 2021.3

Language：English   Presentation type：Oral presentation (general)  

Venue：online   Country：Japan  

Event date： 2019.2 - 2019.3

Language：English   Presentation type：Oral presentation (general)  

Venue：Ikaho, Gunma   Country：Japan  

Event date： 2018.9

Language：English   Presentation type：Oral presentation (general)  

Venue：Ikaho, Gunma   Country：Japan  

Event date： 2018.3

Language：Japanese   Presentation type：Poster presentation  

Venue：皆生グランドホテル天水   Country：Japan  

組合せ最適化問題は様々な分野に応用できるが，効率良く解くためには専門知識を必要とするという問題がある．本研究では，組合せ最適化問題を簡潔に記述できなおかつ効率的に解くことができるシステムの構築を目指して，理論的な枠組として関係の集合上に拡張した関係代数を提案し，それに基づく拡張SQL構文とその汎用ソルバによる解法を議論する．

Event date： 2018.3

Language：Japanese   Presentation type：Poster presentation  

Venue：皆生グランドホテル天水   Country：Japan  

難解プログラミング言語とは意図的に読解が困難になるように設計された言語であり、中でも難解な言語としてMalbolgeがある。現在では低級アセンブリ言語と制御付き疑似命令列を経てC言語に制限を設けた高級言語からのコンパイラが実現されている。しかしこの高級言語では配列を扱うことができず、複雑なプログラムが書けなかった。本研究では配列を含む高級言語を処理してMalbolgeへ変換する手法を実装した。この変換にはメモリの空き領域をスタックとして用いることで実現した。

Event date： 2017.9

Language：English   Presentation type：Oral presentation (general)  

Venue：Matsue, Shimane   Country：Japan  

Event date： 2017.2 - 2017.3

Language：English   Presentation type：Oral presentation (general)  

Venue：Shinojima, Aichi   Country：Japan  

Event date： 2016.9

Language：English   Presentation type：Oral presentation (general)  

Country：Austria  

Event date： 2014.9

Language：English   Presentation type：Oral presentation (general)  

Venue：Jozankei, Sapporo   Country：Japan  

Event date： 2014.3

Language：English   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2014.3

Language：English  

Country：Denmark  

Event date： 2013.7

Language：English   Presentation type：Oral presentation (invited, special)  

Country：Germany  

In this talk, we introduce an automated theorem proving method based on rewriting induction of constrained TRSs, and show how to apply it to the verification of C programs over integers. Especially, we show a technique to automatically generate (a candidate of) lamma equations that are necessary for the proof.

Event date： 2012.11

Language：English   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2012.10

Language：English   Presentation type：Oral presentation (general)  

Country：Austria  

In this talk, I present two principles of program inversion
in term rewriting setting, a classical one and another one for tail
recursion. Rewrite rules generated by inversion methods based on the
principles are often non-deterministic w.r.t. application of rules to
redexes even if given functions are injective. For this reason,
determinization of inverted programs is one of the most challenging
topics in program inversion of injective functions. To make inverted
programs deterministic, I present an MSV transformation of term
rewriting systems, which converts a rewrite system to a more specific
version. The notion of MSV originated from the context of logic
programs.

Event date： 2011.12

Language：English   Presentation type：Oral presentation (invited, special)  

Country：Spain  

Event date： 2011.9

Language：Japanese   Presentation type：Poster presentation  

Country：Japan  

Event date： 2011.9

Language：English   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2011.9

Language：English   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2011.3

Language：Japanese   Presentation type：Poster presentation  

Venue：定山渓ビューホテル   Country：Japan  

Event date： 2011.3

Language：Japanese   Presentation type：Poster presentation  

Venue：定山渓ビューホテル   Country：Japan  

Event date： 2011.3

Language：Japanese   Presentation type：Poster presentation  

Venue：定山渓ビューホテル   Country：Japan  

Event date： 2011.2

Language：English   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2010.3

Language：Japanese   Presentation type：Poster presentation  

Country：Japan  

Event date： 2010.3

Language：Japanese   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2010.2

Language：English   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2009.9

Language：English   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2009.9

Language：Japanese   Presentation type：Poster presentation  

Country：Japan  

Event date： 2008.3

Language：Japanese  

Country：Japan  

Event date： 2007.8

Language：English   Presentation type：Oral presentation (general)  

Event date： 2007.2

Language：English   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2006.9

Language：English   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2006.2

Language：English   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2005.8

Language：English   Presentation type：Oral presentation (general)  

Event date： 2004.11

Language：English   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2004.10

Language：English   Presentation type：Oral presentation (invited, special)  

Country：Japan  

Event date： 2004.4

Language：English   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2003.9

Language：English   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2003.3

Language：English   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2002.10

Language：English   Presentation type：Oral presentation (general)  

Event date： 2002.3

Language：English   Presentation type：Oral presentation (general)