Guarded terms for rewriting modulo SMT

Kyungmin Bae, Camilo Rocha

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Scopus citations

Abstract

Rewriting modulo SMT is a novel symbolic technique to model and analyze infinite-state systems that interact with a nondeterministic environment. It seamlessly combines rewriting modulo equational theories, SMT solving, and model checking. One of the main challenges of this technique is to cope with the symbolic state-space explosion problem. This paper presents guarded terms, an approach to deal with this problem for rewriting modulo SMT. 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.

Original languageEnglish
Title of host publicationFormal Aspects of Component Software - 14th International Conference, FACS 2017, Proceedings
EditorsMarkus Lumpe, Jose Proenca
PublisherSpringer Verlag
Pages78-97
Number of pages20
ISBN (Print)9783319680330
DOIs
StatePublished - 2017
Event14th International Conference on Formal Aspects of Component Software, FACS 2017 - Braga, Portugal
Duration: 10 Oct 201713 Oct 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10487 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Conference on Formal Aspects of Component Software, FACS 2017
Country/TerritoryPortugal
CityBraga
Period10/10/1713/10/17

Fingerprint

Dive into the research topics of 'Guarded terms for rewriting modulo SMT'. Together they form a unique fingerprint.

Cite this