Specifications in an arbitrary institution
Information and Computation - Semantics of Data Types
The Unified Modeling Language user guide
The Unified Modeling Language user guide
Fork Algebras in Algebra, Logic and Computer Science
Fork Algebras in Algebra, Logic and Computer Science
Logical systems for structured specifications
Theoretical Computer Science
Moving Between Logical Systems
Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification
Interpretability of First-Order Dynamic Logic in a Relational Calculus
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
A Heterogeneous Approach to UML Semantics
Concurrency, Graphs and Models
Institution-independent Model Theory
Institution-independent Model Theory
The heterogeneous tool set, HETS
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Fork algebras as a sufficiently rich universal institution
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Hi-index | 0.00 |
In previous articles we presented Argentum, a tool for reasoning across heterogeneous specifications based on the language of fork algebras. Argentum'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.