Proving semantic properties as first-order satisfiability

Lucas, Salvador

doi:10.1016/j.artint.2019.103174

Cited by 7 publications

(2 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the CTRS R in Fig. 1, we obtain a theory R from I(R) as follows [11,Section 4.5]: the inference rules (ρ) Examples 6 and 7 illustrate and motivate the use of theories involving predicates not in P.…”

Section: Feasibility Of Sequences and Goalsmentioning

confidence: 99%

“…Sentences in Theorem 1 are Existentially Closed Boolean Combinations of Atoms (ECBCAs), i.e., formulas of the form (∃x) m i=1 ni j=1 A ij , where A ij are atoms and x is the sequence of variables occurring in such atoms. We have investigated them in [9,11]. Requiring preservation is necessary for items (2) and (3) in Theorem 1.…”

Section: Example 3 (Continuing Example 1)mentioning

confidence: 99%

See 1 more Smart Citation

Automatically Proving and Disproving Feasibility Conditions

Gutiérrez

Lucas

2020

Automated Reasoning

Self Cite

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

Section: Feasibility Of Sequences and Goalsmentioning

confidence: 99%

Section: Example 3 (Continuing Example 1)mentioning

confidence: 99%

Automatically Proving and Disproving Feasibility Conditions

Gutiérrez

Lucas

2020

Automated Reasoning

Self Cite

View full text Add to dashboard Cite

show abstract

mu-term: Verify Termination Properties Automatically (System Description)

Gutiérrez

Lucas

2020

Automated Reasoning

Self Cite

View full text Add to dashboard Cite

We report on the new version of mu-term, a tool for proving termination properties of variants of rewrite systems, including conditional, context-sensitive, equational, and order-sorted rewrite systems. We follow a unified, logic-based approach to describe rewriting computations. The automatic generation of logical models for suitable firstorder theories and formulas provides a common basis to implement the proofs.Supported by EU (FEDER), and projects RTI2018-094403-B-C32,PROMETEO/ 2019/098, and SP20180225. Also by INCIBE program "Ayudas para la excelencia de los equipos de investigación avanzada en ciberseguridad" (Raúl Gutiérrez).

show abstract