Lambda expressions in casl architectural specifications

Authors:
Mihai Codescu
Affiliations:
DFKI GmbH, Bremen, Germany
Venue:
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Year:
2010

Citing 6
Cited 1

Toward formal development of programs from algebraic specifications: implementations revisited

Acta Informatica
Institutions: abstract model theory for specification and programming

Journal of the ACM (JACM)
Algebraic specification in CASL

Software specification methods
Semantics of Architectural Specifications in CASL

FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
The heterogeneous tool set, HETS

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
A simple refinement language for CASL

WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques

Refinement trees: calculi, tools, and applications

CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Casl architectural specifications provide a way to specify the structure of the implementations of software systems. Their semantics has been introduced in two manners: the first is purely model-theoretic and the second attempts to discharge model semantics conditions statically based on a diagram of dependencies between components (extended static semantics). In the case of lambda expressions, which are used to define the way generic units are built, the two semantics do not agree. We present a number of situations of practical importance when the current situation is unsatisfactory and propose a series of changes to the extended static semantics to remedy this.