Analysis of rewriting-based systems as first-order theories

DOI10.1007/978-3-319-94460-9_11OpenAlexW2833946054MaRDI QIDQ1671151

Salvador Lucas

Publication date: 6 September 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94460-9_11

zbMATH Keywords

program analysislogical modelsrewriting-based systems

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Automatically Proving and Disproving Feasibility Conditions ⋮ The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors ⋮ Use of logical models for proving infeasibility in term rewriting ⋮ Proving semantic properties as first-order satisfiability

This page was built for publication: Analysis of rewriting-based systems as first-order theories