Generic programming

Musser, David R.; Stepanov, Alexander A.

doi:10.1007/3-540-51084-2_2

Cited by 70 publications

(46 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Designers are expected to start an architectural description by the components, then derive connectors for them, and finally specify appropriate strategies. Connector roles are defined over component interface fragments, as is done in generic programming [10,29]. For example, C++'s STL defines algorithm sort on a sequence of elements of type T, using T's less-than, assignment, and copy constructor operations.…”

Section: Running Example -The Dining Philosophersmentioning

confidence: 99%

Xcd – Modular, Realizable Software Architectures

Kloukinas

Özkaya

2013

Formal Aspects of Component Software

View full text Add to dashboard Cite

Abstract. Connector-Centric Design (XCD) is centred around a new formal architectural description language, focusing mainly on complex connectors. Inspired by Wright and BIP, XCD aims to cleanly separate in a modular manner the high-level functional, interaction, and control system behaviours. This can aid in both increasing the understandability of architectural specifications and the reusability of components and connectors themselves. Through the independent specification of control behaviours, XCD allows designers to experiment more easily with different design decisions early on, without having to modify the functional behaviour specifications (components) or the interaction ones (connectors).At the same time XCD attempts to ease the architectural specification by following (and extending) a Design-by-Contract approach, which is more familiar to software developers than process algebras like CSP or languages like BIP that are closer to synchronous/hardware specification languages. XCD extends Designby-Contract (i) by separating component contracts into functional and interaction sub-contracts, and (ii) by allowing service consumers to specify their own contractual clauses. XCD connector specifications are completely decentralized, foregoing Wright's connector glue, to ensure their realizability by construction.

show abstract

Section: Running Example -The Dining Philosophersmentioning

confidence: 99%

Xcd – Modular, Realizable Software Architectures

Kloukinas

Özkaya

2013

Formal Aspects of Component Software

View full text Add to dashboard Cite

show abstract

“…With the explicit goal of improving the reuse of software libraries, generic programming has emerged as an important paradigm for the development of highly efficient and maximally reusable software [4]. Generic programming involves the implementation of generic (abstract) algorithms that operate correctly and efficiently on a wide range of data types-including those not known at algorithm design time-so long as the data types meet certain requirements expressed as type properties.…”

Section: Generic Programmingmentioning

confidence: 99%

“…For example, we are able to parallelize the following code segment: This code segment calls accumulate(), a generic algorithm implemented in the C++ Standard Template Library (STL) [3]. The STL is an excellent example of Generic Programming, an important programming paradigm that is used for the development of highly efficient and maximally reusable software [4]. Moreover, the STL is a widely-used portion of the C++ Standard Library, so parallelizing it can have an immediate impact on many existing C++ applications.…”

Section: Introductionmentioning

confidence: 99%

Parallelization of Generic Libraries Based on Type Properties

Kambadur

Gregor

Lumsdaine

2007

Computational Science – ICCS 2007

View full text Add to dashboard Cite

Abstract. This paper describes a new approach for parallelizing generic software libraries. Generic algorithms are expressed in terms of type properties, which allows them to work with entire families of types rather than specific types. Despite this generality, generic algorithms can be made as efficient as their hand-coded variants through the use of specialization, which provides algorithm variants tuned for types with certain properties. Our approach leverages the specialization mechanism of generic programming to effect parallelism. We illustrate the process of specializing generic algorithms for parallelism using common algorithms in the C++ Standard Template Library. When the resulting algorithms are invoked with types that have the required properties for parallelization, the parallel variants of these algorithms are executed. We illustrate that our parallelization strategy is simple, practical, and efficient, using tools and techniques available in most commercial compilers.

show abstract

“…The idea of reusable specification templates arises from our decision to define the dynamic semantics as a software solution implementing the dynamic semantics, rather than as a set of requirements on the behavior resulting from such an implementation. Specification templates realize the generic programming paradigm [32] for (thorough mathematical-based) formal specifications (Sect. 2.2).…”

Section: Introductionmentioning

confidence: 99%

Reusable specification templates for defining dynamic semantics of DSLs

Tikhonova

2017

Softw Syst Model

View full text Add to dashboard Cite

In the context of model-driven engineering, the dynamic (execution) semantics of domain-specific languages (DSLs) is usually not specified explicitly and stays (hard) coded in model transformations and code generation. This poses challenges such as learning, debugging, understanding, maintaining, and updating a DSL. Facing the lack of supporting tools for specifying the dynamic semantics of DSLs (or programming languages in general), we propose to specify the architecture and the detailed design of the software that implements the DSL, rather than requirements for the behavior expected from DSL programs. To compose such a specification, we use specification templates that capture software design solutions typical for the (application) domain of the DSL. As a result, on the one hand, our approach allows for an explicit and clear definition of the dynamic semantics of a DSL, supports separation of concerns and reuse of typical design solutions. On the other hand, we do not introduce (yet another) specification formalism, but we base our approach on an existing formalism and apply its extensive tool support for verification and validation to the dynamic semantics of a DSL.

show abstract

Generic programming

Cited by 70 publications

References 2 publications

Xcd – Modular, Realizable Software Architectures

Xcd – Modular, Realizable Software Architectures

Parallelization of Generic Libraries Based on Type Properties

Reusable specification templates for defining dynamic semantics of DSLs

Contact Info

Product

Resources

About