Institutions for navigational logics for graphical structures
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 ho...
| Authors: | , , , |
|---|---|
| Format: | article |
| Publication Date: | 2018 |
| Country: | España |
| Institution: | Universitat Politècnica de Catalunya (UPC) |
| Repository: | UPCommons. Portal del coneixement obert de la UPC |
| Language: | English |
| OAI Identifier: | oai:upcommons.upc.edu:2117/115595 |
| Online Access: | https://hdl.handle.net/2117/115595 https://dx.doi.org/10.1016/j.tcs.2018.02.031 |
| Access Level: | Open access |
| Keyword: | Formal methods (Computer science) Graph theory Software engineering Institutions Graph logics Navigational logics Mètodes formals (Informàtica) Grafs, Teoria de Enginyeria del programari Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Summary: | 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. |
|---|