Symbolic state space reduction with guarded terms for rewriting modulo SMT

Abstract

• Guarded terms provide an approach to deal with the symbolic state-explosion problem for rewriting modulo SMT. • A guarded term has the potential to encode many symbolic states into one by using constraints as part of its structure. • Succinct exploration of the symbolic state space can be achieved by reducing branching, and the complexity and size of constraints. • A case study of an unbounded and symbolic priority queue illustrates the approach. Rewriting modulo SMT is a novel symbolic technique to model and analyze infinite-state systems that interact with a non-deterministic environment, by seamlessly combining rewriting modulo equational theories, SMT solving, and model checking. This paper presents guarded terms, an approach to deal with the symbolic state-space explosion problem for rewriting modulo SMT, one of the main challenges of this technique. Guarded terms can encode many symbolic states into one by using SMT constraints as part of the term structure. This approach enables the reduction of the symbolic state space by limiting branching due to concurrent computation, and the complexity and size of constraints by distributing them in the term structure. A case study of an unbounded and symbolic priority queue illustrates the approach.