Complete calculi for structured specifications in fork algebra
In previous articles we presented Arg entum, a tool for reasoning across heterogeneous specifications based on the language of fork algebras. Arg entum's foundations were formalized in the framework of institutions. The formalization made simple to describe a methodology capable of producing a...
Guardado en:
| Autores principales: | , |
|---|---|
| Publicado: |
2010
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v6255LNCS_n_p290_LopezPombo http://hdl.handle.net/20.500.12110/paper_03029743_v6255LNCS_n_p290_LopezPombo |
| Aporte de: |
| Sumario: | In previous articles we presented Arg entum, a tool for reasoning across heterogeneous specifications based on the language of fork algebras. Arg entum's foundations were formalized in the framework of institutions. The formalization made simple to describe a methodology capable of producing a complete system desription from partial views, eventually written in different logical languages. Structured specifications were introduced by Sannella and Tarlecki and extensively studied by Borzyszkowski. The latter also presented conditions under which the calculus for structured specifications is complete. Using fork algebras as a "universal" institution capable of representing expressive logics (such as dynamic and temporal logics), requires using a fork language that includes a reflexive-transitive closure operator. The calculus thus obtained does not meet the conditions required by Borzyszkowski. In this article we present structure building operators (SBOs) over fork algebras, and provide a complete calculus for these operators. © 2010 Springer-Verlag. |
|---|