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...
Saved in:
Published in | Journal of logical and algebraic methods in programming Vol. 130; p. 100810 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
01.01.2023
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!