Cargando…
Automatically Proving and Disproving Feasibility Conditions
In the realm of term rewriting, given terms s and t, a reachability condition [Formula: see text] is called feasible if there is a substitution [Formula: see text] such that [Formula: see text] rewrites into [Formula: see text] in zero or more steps; otherwise, it is called infeasible. Checking infe...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7324039/ http://dx.doi.org/10.1007/978-3-030-51054-1_27 |