Resumen:
We show that a Navigational Logic, i.e., a logic to express properties about graphs and about paths in graphs is a semi-exact institution. In this way, we can use a number of operations to structure and modularize our specifications. Moreover, using the properties of our institution, we also show how to structure single formulas, which in our formalism could be quite complex. Article in press in Theoretical Computer Science (2018) https://doi.org/10.1016/j.tcs.2018.02.031
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:014,
title={{Institutions for navigational logics for graphical structures (Trabajo ya publicado)}},
author={Fernando Orejas and Elvira Pino and Marisa Navarro and Leen Lambers},
url={http://hdl.handle.net/11705/PROLE/2018/014},
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