Abstract Behavior Types: A Foundation Model for Components and Their Composition

@inproceedings{Arbab2002AbstractBT,
  title={Abstract Behavior Types: A Foundation Model for Components and Their Composition},
  author={F. Arbab},
  booktitle={FMCO},
  year={2002}
}
  • F. Arbab
  • Published in FMCO 2002
  • Computer Science
The notion of Abstract Data Type (ADT) has served as a foundation model for structured and object oriented programming for some thirty years. The current trend in software engineering toward component based systems requires a foundation model as well. The most basic inherent property of an ADT, i.e., that it provides a set of operations, subverts some highly desirable properties in emerging formal models for components that are based on the object oriented paradigm. We introduce the notion of… Expand
A type-level approach to component prototyping
TLDR
This paper presents an approach to prototyping of component-based systems that employs so-called type-level programming (or compile-time computation) to bridge the gap between abstract component models and their type-safe implementation in a functional programming language. Expand
A Behavioral Model for Composition of Software Components
  • F. Arbab
  • Computer Science
  • Obj. Logiciel Base données Réseaux
  • 2006
TLDR
The ABT model serves as a unifying formalism to express the behavior of Reo connectors, as well as that of components, in a simpler model of components and their composition. Expand
Program Components & Abstract Behavioral Types
TLDR
The basis of the behavioral description of the component-based complex system and definition of the model is Abstract Behavioral Type (ABT) which yields behavior of the program component as maximal interactions among observable timed data streams. Expand
On Refinement of Software Architectures
TLDR
A major contribution of this paper is the introduction of a set of rules for architectural refinement at three different but interrelated levels: behavioural, syntactic, i.e., relative to component interfaces, and architectural. Expand
Correlating Formal Semantic Models of Reo Connectors: Connector Coloring and Constraint Automata
TLDR
This paper investigates the equivalence between coloring models and constraint automata, the two most dominant and practically relevant semantic models of Reo, and defines operators that transform one model to the other (and vice versa), prove their correctness, and show that they distribute over composition. Expand
A Methodology for Construction of Composable Formal Models from SystemC in BIP
We present an approach that is intended to facilitate the integration of domain-specific languages and heterogeneous systems on a semantic level by mapping language constructs to concepts in anExpand
Component-based Modeling of Heterogeneous Real-time Systems in BIP. (Modélisation à base de Composants de Systèmes Temps réel Hétérogènes en BIP)
TLDR
An implementation of Bip as a tool chain that allows modeling, static analysis and execution of BIP descriptions on a dedicated engine is presented, and the use of the tool chain for two major application domains, Software Componentization, and Modeling mixed hw/sw systems. Expand
A Preliminary Comparative Study on the Expressive Power of Reo and Linda
TLDR
A couple of modular embeddings for the synchronous case and the asynchronous case are provided by defining a common formalism in order to allow the comparison of both models at an homogeneous level of abstraction. Expand
Symbolic Implementation of Connectors in BIP
TLDR
A symbolic implementation of the execution model of BIP is proposed, based on computing boolean representation for components, connectors, and priorities with an existing BDD package, which drastically reduces this overhead in execution times. Expand
An Approach to Refining Active Components Based on Component Calculus
TLDR
By defining the semantics of a component as a mapping from the contract of its required interface to thecontract of its provide interface, component refinement can be proved in terms of contract refinement, and the theories applying simulation techniques to assure the refinement relation are proved. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 103 REFERENCES
A Calculus for Modeling Software Components
TLDR
A calculus for modeling components is proposed, based on the asynchronous π calculus extended with explicit namespaces, or “forms”, which serves as a semantic foundation and an executable abstract machine for Piccola, an experimental composition language. Expand
A behavioral notion of subtyping
TLDR
This paper presents a way of specifying types that makes it convenient to define the subtype relation, and discusses the ramifications of this notion of subtyping on the design of type families. Expand
A Logical Basis for Component-Based Systems Engineering
TLDR
A comprehensive logical basis for the development of systems is provided and it is shown in particular that all the concepts of the approach are modular, the key property for component oriented system engineering. Expand
A framework for comparing models of computation
We give a denotational framework (a "meta model") within which certain properties of models of computation can be compared. It describes concurrent processes in general terms as sets of possibleExpand
A really abstract concurrent model and its temporal logic
TLDR
It is shown that, by imposing the crucial condition of finite variability, the radical notion that a computational model based on the reals provides a more abstract description of concurrent and reactive systems, than the conventional conventional behavioral model of execution sequencing is advanced. Expand
Reo: a channel-based coordination model for component composition
  • F. Arbab
  • Computer Science
  • Mathematical Structures in Computer Science
  • 2004
TLDR
It is shown that exogenous coordination patterns that can be expressed as (meta-level) regular expressions over I/O operations can be composed in Reo out of a small set of only five primitive channel types. Expand
A Logical Interface Description Language for Components
TLDR
The main results in this paper are the theorems that formulate the notion of compositionality and the completeness of the derivation system that supports this property in a component-based system. Expand
Modeling dynamic component interfaces
TLDR
A component model based on object-oriented systems is adopted, and component interface diagrams (CIDs) are introduced-an adaption of UML diagrams-as a notation to characterize interfaces of components, their structure, and their navigability. Expand
A Formal Method for the Systematic Reuse of Specification Components
TLDR
A method for the systematic reuse of formal specifications by reusing already existing components based on the following “divide and conquer” principle: a given specification is decomposed into appropriate subspecifications; these are matched with existing components. Expand
Coalgebraic Specifications and Models of Determinatistic Hybrid Systems
  • B. Jacobs
  • Computer Science, Mathematics
  • AMAST
  • 1996
TLDR
This work defines a notion of model for such a specification, and defines what it means for a model to be terminal, and shows that standard model theory can be applied to temporal (coalgebraic) specifications. Expand
...
1
2
3
4
5
...