A Constructor-Based Reachability Logic for Rewrite Theories

DOI10.3233/FI-2020-1926zbMath1471.68076MaRDI QIDQ5134281

Stephen Skeirik, José Meseguer, Andrei Ştefănescu

Publication date: 16 November 2020

Published in: Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

rewriting logicdeductive verificationreachability logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42) Temporal logic (03B44) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Variants and satisfiability in the infinitary unification wonderland ⋮ Capturing constrained constructor patterns in matching logic ⋮ Equational unification and matching, and symbolic reachability analysis in Maude 3.2 (system description) ⋮ Symbolic computation in Maude: some tapas

This page was built for publication: A Constructor-Based Reachability Logic for Rewrite Theories