Guarded terms for rewriting modulo SMT

Kyungmin Bae, Camilo Rocha

Producción: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

9 Citas (Scopus)

Resumen

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.

Idioma originalInglés
Título de la publicación alojadaFormal Aspects of Component Software - 14th International Conference, FACS 2017, Proceedings
EditoresMarkus Lumpe, Jose Proenca
EditorialSpringer Verlag
Páginas78-97
Número de páginas20
ISBN (versión impresa)9783319680330
DOI
EstadoPublicada - 2017
Evento14th International Conference on Formal Aspects of Component Software, FACS 2017 - Braga, Portugal
Duración: 10 oct. 201713 oct. 2017

Serie de la publicación

NombreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumen10487 LNCS
ISSN (versión impresa)0302-9743
ISSN (versión digital)1611-3349

Conferencia

Conferencia14th International Conference on Formal Aspects of Component Software, FACS 2017
País/TerritorioPortugal
CiudadBraga
Período10/10/1713/10/17

Huella

Profundice en los temas de investigación de 'Guarded terms for rewriting modulo SMT'. En conjunto forman una huella única.

Citar esto