Over-Approximating Terms Reachable by Context-Sensitive Rewriting

Andrianarivelo, Nirina; Réty, Pierre

doi:10.1007/978-3-319-24537-9_12

Cited by 3 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“….}). 1 Let T = {Th | ∈ P} be a P-indexed set of first-order theories Th defining the predicates in P, possibly involving predicate symbols which are not in P.…”

Section: Feasibility Of Sequences and Goalsmentioning

confidence: 99%

“…Decidability of reachability problems for CSR in TRSs (i.e., does s → * t hold?) has been investigated using tree-automata techniques [1,[6][7][8]. infChecker is able to (try to) prove and disprove reachability conditions as f-goals using predicate \->* without any specific restriction on the TRSs (e.g., left-linearity), as done in these papers.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Automatically Proving and Disproving Feasibility Conditions

Gutiérrez

Lucas

2020

Automated Reasoning

View full text Add to dashboard Cite

In the realm of term rewriting, given terms s and t, a reachability condition s → * t is called feasible if there is a substitution σ such that σ(s) rewrites into σ(t) in zero or more steps; otherwise, it is called infeasible. Checking infeasibility of (sequences of) reachability conditions is important in the analysis of computational properties of rewrite systems like confluence or (operational) termination. In this paper, we generalize this notion of feasibility to arbitrary n-ary relations on terms defined by first-order theories. In this way, properties of computational systems whose operational semantics can be given as a first-order theory can be investigated. We introduce a framework for proving feasibility/infeasibility, and a new tool, infChecker, which implements it.

show abstract

“….}). 1 Let T = {Th | ∈ P} be a P-indexed set of first-order theories Th defining the predicates in P, possibly involving predicate symbols which are not in P.…”

Section: Feasibility Of Sequences and Goalsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Automatically Proving and Disproving Feasibility Conditions

Gutiérrez

Lucas

2020

Automated Reasoning

View full text Add to dashboard Cite

show abstract

Over-Approximating Terms Reachable by Context-Sensitive Rewriting

Andrianarivelo

Réty

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Context-sensitive Rewriting

Lucas

2020

ACM Comput. Surv.

View full text Add to dashboard Cite

The appropriate selection of the arguments of functions that can be evaluated in function calls is often useful to improve efficiency, speed, termination behavior, and so on. This is essential, e.g., in the conditional if - then - else operator. We can specify this by associating a set μ(f) of indices of evaluable arguments to each function symbol f . With μ (if - then - else)={1}, only the Boolean argument b in calls if b , then e else e' is evaluated. In the realm of term rewriting, this is called context-sensitive rewriting . It has been proven useful to improve the termination behavior of rewriting computations while it is still able to compute (or approximate) canonical forms like head-normal forms, (infinite) values, and (infinite) normal forms by requiring a few reasonable conditions. This article provides an overview of basic results to use context-sensitive rewriting in practice.

show abstract

Over-Approximating Terms Reachable by Context-Sensitive Rewriting

Cited by 3 publications

References 11 publications

Automatically Proving and Disproving Feasibility Conditions

Automatically Proving and Disproving Feasibility Conditions

Over-Approximating Terms Reachable by Context-Sensitive Rewriting

Context-sensitive Rewriting

Contact Info

Product

Resources

About