A Constructor-Based Reachability Logic for Rewrite Theories

09/15/2017
by   Stephen Skeirik, et al.
0

Reachability logic has been applied to K rewrite-rule-based language definitions as a language-generic logic of programs. To be able to verify not just code but also distributed system designs, a new rewrite-theory-generic reachability logic is presented and proved sound for a wide class of rewrite theories. The logic's automation is increased by means of constructor-based semantic unification, matching, and satisfiability procedures. New methods for proving invariants of possibly never terminating distributed systems are developed, and experiments with a prototype implementation illustrating the new proof methods are presented.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset