Abstract
In previous articles we presented Ar g entum, a tool for reasoning across heterogeneous specifications based on the language of fork algebras. Ar g 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Booch, G., Rumbaugh, J., Jacobson, I.: The unified modeling language user guide. Addison–Wesley Longman Publishing Co., Inc., Boston (1998)
Frias, M.F.: Fork algebras in algebra, logic and computer science. Advances in logic, vol. 2. World Scientific Publishing Co., Singapore (2002)
Frias, M.F., Baum, G.A., Maibaum, T.S.E.: Interpretability of first-order dynamic logic in a relational calculus. In: de Swart, H. (ed.) RelMiCS 2001. LNCS, vol. 2561, pp. 66–80. Springer, Heidelberg (2002)
Frias, M.F., Lopez Pombo, C.G.: Time is on my side. In: Procs. of RelMiCS 7, pp. 105–111 (2003)
Frias, M.F., Lopez Pombo, C.G.: Interpretability of first-order linear temporal logics in fork algebras. JLAP 66(2), 161–184 (2006)
Goguen, J.A., Burstall, R.M.: Introducing institutions. In: Hutchison, D., Shepherd, W.D., Mariani, J.A. (eds.) Local Area Networks: An Advanced Course. LNCS, vol. 184, pp. 221–256. Springer, Heidelberg (1985)
Meseguer, J.: General logics. In: Procs. of the Logic Colloquium 1987, vol. 129, pp. 275–329. North Holland, Amsterdam (1989)
Tarlecki, A.: Moving between logical systems. In: Haveraaen, M., Dahl, O.-J., Owe, O. (eds.) Abstract Data Types 1995 and COMPASS 1995. LNCS, vol. 1130, pp. 478–502. Springer, Heidelberg (1996)
Lopez Pombo, C.G., Frias, M.F.: Fork algebras as a sufficiently rich universal institution. In: Johnson, M., Vene, V. (eds.) AMAST 2006. LNCS, vol. 4019, pp. 235–247. Springer, Heidelberg (2006)
Borzyszkowski, T.: Logical systems for structured specifications. TCS 286, 197–245 (2002)
Tarski, A.: On the calculus of relations. JSL 6(3), 73–89 (1941)
Maddux, R.D.: Finitary algebraic logic. Zeitschrift fur Mathematisch Logik und Grundlagen der Mathematik 35, 321–332 (1989)
Burris, S., Sankappanavar, H.P.: A course in universal algebra. Graduate Texts in Mathematics. Springer, Berlin (1981)
Sannella, D., Tarlecki, A.: Specifications in an arbitrary institution. Information and computation 76(2-3), 165–210 (1988)
Tarlecki, A.: Abstract specification theory: an overview. In: Procs. of the NATO Advanced Study Institute on Models, Algebras and Logic of Engineering Software. NATO Science Series, pp. 43–79. IOS Press, Marktoberdorf (2003)
Diaconescu, R. (ed.): Institution-independent Model Theory, Studies in Universal Logic, vol. 2. Birkhäuser, Basel
Mossakowski, T., Maeder, C., Luttich, K.: The heterogeneous tool set, Hets. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 519–522. Springer, Heidelberg (2007)
Tarlecki, A.: Towards heterogeneous specifications. In: Gabbay, D., de Rijke, M. (eds.) Frontiers of Combining Systems. Studies in Logic and Computation, vol. 2, pp. 337–360. Research Studies Press (2000)
Cengarle, M.V., Knapp, A., Tarlecki, A., Wirsing, M.: A heterogeneous approach to UML semantics. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 383–402. Springer, Heidelberg (2008)
Roşu, G., Goguen, J.A.: On equational craig interpolation. Journal of Universal Computer Science 6(1), 194–200 (2000)
Tarski, A., Givant, S.: A formalization of set theory without variables. American Mathematical Society Colloqium Publications, Providence (1987)
Lopez Pombo, C.G.: Fork algebras as a tool for reasoning across heterogeneous specifications. PhD thesis, Universidad de Buenos Aires (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lopez Pombo, C.G., Frias, M.F. (2010). Complete Calculi for Structured Specifications in Fork Algebra. In: Cavalcanti, A., Deharbe, D., Gaudel, MC., Woodcock, J. (eds) Theoretical Aspects of Computing – ICTAC 2010. ICTAC 2010. Lecture Notes in Computer Science, vol 6255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14808-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-14808-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14807-1
Online ISBN: 978-3-642-14808-8
eBook Packages: Computer ScienceComputer Science (R0)