Resumen:
In this paper we propose a new idea for the implementation of symbolic model checking. Our pro- posal takes advantage of two technologies. First, SMT-solvers as efficient auxiliary tools to perform a large proportion of the computational task. Second, the context-based tableau that is especially well suited for providing certificates of proved properties, as well as counterexamples of disproved properties. We mainly introduce the algorithm to be implemented, along with illustrative examples.
Descargas:
Este artículo tiene una licencia de uso CreativeCommons - Reconocimiento (by)
Descarga el artículo haciendo click aquí.
Ver la referencia en formato Bibtex
@inproceedings{prole:2018:019,
title={{Context-based Model Checking using SMT-solvers (Trabajo en progreso)}},
author={Alex Abuin and Unai D{\'i}az de Cerio and Montserrat Hermo and Paqui Lucio},
url={http://hdl.handle.net/11705/PROLE/2018/019},
booktitle={PROLE2018},
year={2018},
publisher={SISTEDES},
crossref={prole2018sevilla}
}
@proceedings{prole2018sevilla,
title={{ Actas de las XVIII Jornadas de Programaci{\'o}n y Lenguajes (PROLE 2018).}},
editor={Ortega Mall{\'e}n, Y.},
booktitle={PROLE2018},
year={2018},
publisher={SISTEDES}
}
Copiar al portapapeles |
Cerrar