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.
Orejas, F., Pino, E., Navarro, M., Lambers, L. Institutions for navigational logics for graphical structures. "Theoretical computer science", 12 Setembre 2018, vol. 741, p. 19-24.