Abstract
scCASL, a specification formalism developed recently by the CoFI group, offers architectural specifications as a way to describe how simpler modules can be used to construct more complex ones. The semantics for Casl architectural specifications formulates static amalgamation conditions as a prerequisite for such constructions to be well-formed. These are non-trivial in the presence of subsorts due to the failure of the amalgamation property for the CASL institution. We show that indeed the static amalgamation conditions for CASL are undecidable in general. However, we identify a number of practically relevant special cases where the problem becomes decidable and analyze its complexity there. In cases where the result turns out to be PSPACE-hard, we discuss further restrictions under which polynomial algorithms become available. All this underlies the static analysis as implemented in the CASL tool set.
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
M. Bednarczyk, M. Borzyszkowski, and W. Pawłowski. Generalized congruences-epimorphisms in Cat. Theory and Applications of Categories 5 (1999), 266–280.
M. Bidoit, D. Sannella and A. Tarlecki. Architectural specifications in Casl. Algebraic Methodology and Software Technology, LNCS 1548, 341–357. Springer, 1999.
CoFI Semantics Task Group. Casl-The CoFI Algebraic Specification Language-Semantics. Note S-9 (v. 0.96), July 1999. Accessible by WWW2 and FTP3.
CoFI Language Design Task Group. Casl-The CoFI Algebraic Specification Language-Summary, version 1.0.1, June 2000. Accessible by WWW2 and FTP3.
M. Davis. Unsolvable Problems. in: J. Barwise (ed.), Handbook of Mathematical Logic, North Holland, Amsterdam, 1977.
J. Goguen and R. Burstall. Institutions: Abstract model theory for specifications and programming. J. ACM 39 (1992), 95–146.
J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, 1979.
L. C. Paulson. ML for the Working Programmer (2nd ed.). Cambridge, 1996.
L. Schröder. Composition Graphs and Free Extensions of Categories (in German). Ph.D. thesis, University of Bremen, 1999; also: Logos, Berlin, 1999.
L. Schröder and H. Herrlich. Free adjunction of morphisms. Applied Categorical Structures 8 (2000), 595–606.
L. Schröder, T. Mossakowski, A. Tarlecki, B. Klin, and P. Hoffman. Semantics of Architectural Specification in Casl. Fundamental Approaches to Software Engineering, LNCS 2029, 253–268. Springer, 2001.
L. Schröder, T. Mossakowski, A. Tarlecki. Amalgamation via enriched Casl signatures. ICALP 2001, to appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klin, B., Hoffman, P., Tarlecki, A., Schröder, L., Mossakowski, T. (2001). Checking Amalgamability Conditions forCasl Architectural Specifications. In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_40
Download citation
DOI: https://doi.org/10.1007/3-540-44683-4_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42496-3
Online ISBN: 978-3-540-44683-5
eBook Packages: Springer Book Archive