Checking Amalgamability Conditions for C ASL Architectural Specifications

Authors:
Bartek Klin;Piotr Hoffman;Andrzej Tarlecki;Lutz Schröder;Till Mossakowski
Affiliations:
-;-;-;-;-
Venue:
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Year:
2001

Citing 4
Cited 5

Institutions: abstract model theory for specification and programming

Journal of the ACM (JACM)
ML for the working programmer (2nd ed.)

ML for the working programmer (2nd ed.)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Semantics of Architectural Specifications in CASL

FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering

Institution Independent Static Analysis for CASL

WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
Towards Trustworthy Specifications I: Consistency Checks

WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
The Common Framework Initiative for Algebraic Specification and Development of Software: Recent Progress

WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
Verifying Architectural Specifications

WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
Global Development via Local Observational Construction Steps

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

CASL, 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.