Checking amalgamability conditions for CASL architectural specifications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2136, Issue , 2001, Pages 451-463

  Klin, Bartek ^a   Hoffman, Piotr ^b   Tarlecki, Andrzej ^b,c   Schröder, Lutz ^d   Mossakowski, Till ^d  

^a AARHUS UNIVERSITY   (Denmark)

^b UNIVERSITY OF WARSAW   (Poland)

^c INSTITUTE OF COMPUTER SCIENCE   (Poland)

^d UNIVERSITY OF BREMEN   (Germany)

Author keywords

Algorithms; Amalgamation; Architectural specifications; CASL; Decidability; Formal specification and program development

Indexed keywords

ALGORITHMS; COBALT COMPOUNDS; COMPUTABILITY AND DECIDABILITY; IODINE COMPOUNDS; METALS; SEMANTICS; STATIC ANALYSIS;

AMALGAMATION; ARCHITECTURAL SPECIFICATIONS; CASL; NON-TRIVIAL; POLYNOMIAL ALGORITHM; PROGRAM DEVELOPMENT;

FORMAL SPECIFICATION;

EID: 84974662375     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44683-4_40     Document Type: Conference Paper

References (12)

1. M. Bednarczyk, M. Borzyszkowski, and W. Pawłowski. Generalized congruences-epimorphisms in Cat. Theory and Applications of Categories 5 (1999), 266-280.
2. M. Bidoit, D. Sannella and A. Tarlecki. Architectural specifications in CASL. Algebraic Methodology and Software Technology, LNCS 1548, 341-357. Springer, 1999.
3. CoFI Semantics Task Group. CASL-The CoFI Algebraic Specification Language-Semantics. Note S-9 (v. 0.96), July 1999. Accessible by WWWand FTP
4. CoFI Language Design Task Group. CASL-The CoFI Algebraic Specification Language-Summary, version 1.0.1, June 2000. Accessible by WWW2 and FTP3.
5. M. Davis. Unsolvable Problems. in: J. Barwise (ed.), Handbook of Mathematical Logic, North Holland, Amsterdam, 1977.
6. J. Goguen and R. Burstall. Institutions: Abstract model theory for specifications and programming. J. ACM 39 (1992), 95-146.
7. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, 1979.
8. L. C. Paulson. ML for the Working Programmer (2nd ed.). Cambridge, 1996.
9. L. Schröder. Composition Graphs and Free Extensions of Categories (in German). Ph.D. thesis, University of Bremen, 1999; also: Logos, Berlin, 1999.
10. L. Schröder and H. Herrlich. Free adjunction of morphisms. Applied Categorical Structures 8 (2000), 595-606.
11. 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.,,.
12. L. Schröder, T. Mossakowski, A. Tarlecki. Amalgamation via enriched CASL signatures. ICALP 2001, to appear.