Capturing constrained constructor patterns in matching logic

Reachability logic for rewrite theories consists of a specification of system states that are given by constrained constructor patterns, a transition relation that is given by a rewrite theory, and reachability properties expressed as pairs of state specifications. Matching logic has been recently p...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 130; p. 100810
Main Authors Chen, Xiaohong, Lucanu, Dorel, Roşu, Grigore
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.01.2023
Subjects
Online AccessGet full text

Cover

Loading…