Symbolic reachability analysis for rewrite theories

rewriting logic;symbolic reachability analysis;deadlock freedom;inductive invariants;constrained rewriting;theorem proving;propositional tree automata;smt solving

Rocha, Camilo

关键词: rewriting logic;    symbolic reachability analysis;    deadlock freedom;    inductive invariants;    constrained rewriting;    theorem proving;    propositional tree automata;    smt solving;   

Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/42200/Hernan_Rocha%20Nino.pdf?sequence=1&isAllowed=y

美国|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

This dissertation presents a significant step forward in automatic and semi-automatic reasoning for reachability properties of rewriting logic specifications, a major research goal in the current state of the art. In particular, this work develops deductive techniques for reasoning symbolically about specifications with initial model semantics, including: (i) new constructor-based notions for reachability analysis, (ii) a proof system for the task of proving safety properties, and (iii) a novel method for symbolic reachability analysis of rewrite theories with constrained built-ins. These three new techniques are not just theoretical developments: each of them has been implemented in freely available tools for the automated reasoning presented in this thesis and are validated through case studies. These case studies include: (i) a reliable communication protocol, (ii) a secure-by-design browser system, and (iii) a NASA language for robotic machines. One main characteristic of the methods developed in this dissertation is that they are suitable for wide classes of rewrite theories and are highly generic, so that they can be used over many different instance languages and application domains.