A Component Model for the ABS Language

Lienhardt, Michael; Lanese, Ivan; Bravetti, Mario; Sangiorgi, Davide; Zavattaro, Gianluigi; Welsch, Yannick; Schäfer, Jan; Poetzsch-Heffter, Arnd

doi:10.1007/978-3-642-25271-6_9

Cited by 6 publications

(7 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Because of its focus on components, adaptation in MECo is mostly concerned about consistent changes in input/output interfaces; in our case, adaptation is defined in terms of some distinguished observables of the system, thus constituting a rather general way of characterizing correctness. Comp [42] is another process calculus for component models. It is intended to be the component model for the ABS modeling language; as such, it aims at providing a unified definition of evolvability for objects, components, and runtime modifications of programs.…”

Section: S A[p ] a Q A(x) Rmentioning

confidence: 99%

Adaptable processes

Bravetti¹,

Giusto²,

Pérez³

et al. 2012

Logical Methods in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We propose the concept of adaptable processes as a way of overcoming the limitations that process calculi have for describing patterns of dynamic process evolution. Such patterns rely on direct ways of controlling the behavior and location of running processes, and so they are at the heart of the adaptation capabilities present in many modern concurrent systems. Adaptable processes have a location and are sensible to actions of dynamic update at runtime; this allows to express a wide range of evolvability patterns for concurrent processes. We introduce a core calculus of adaptable processes and propose two verification problems for them: bounded and eventual adaptation. While the former ensures that the number of consecutive erroneous states that can be traversed during a computation is bound by some given number k, the latter ensures that if the system enters into a state with errors then a state without errors will be eventually reached. We study the (un)decidability of these two problems in several variants of the calculus, which result from considering dynamic and static topologies of adaptable processes as well as different evolvability patterns. Rather than a specification language, our calculus intends to be a basis for investigating the fundamental properties of evolvable processes and for developing richer languages with evolvability capabilities.

show abstract

Section: S A[p ] a Q A(x) Rmentioning

confidence: 99%

Adaptable processes

Bravetti¹,

Giusto²,

Pérez³

et al. 2012

Logical Methods in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…A description of the core ABS language [15] and the proposed component model [24], along with a tutorial of the full ABS language and HATS tools suite [9] are available. In addition, the HATS tool suite, documentation, as well as several case studies are available from http://www.hats-project.eu.…”

Section: Resultsmentioning

confidence: 99%

Variability Modelling in the ABS Language

Clarke

Muschevici

Proença

et al. 2011

Formal Methods for Components and Objects

View full text Add to dashboard Cite

Abstract. The HATS project aims at developing a model-centric methodology for the design, implementation and verification of highly configurable systems, such as software product lines, centred around the Abstract Behavioural Specification (ABS) modelling Language. This article describes the variability modelling features of the ABS Modelling framework. It consists of four languages, namely, µTVL for describing feature models at a high level of abstraction, the Delta Modelling Language DML for describing variability of the 'code' base in terms of delta modules, the Product Line Configuration Language CL for linking feature models and delta modules together and the Product Selection Language PSL for describing a specific product to extract from a product line. Both formal semantics and examples of each language are presented.

show abstract

“…For example, models like Oz/K [77] and COMP [76] offer a more unified way of presenting objects and components. However, both Oz/K and COMP deal with dynamic reconfigurations in a very complex way.…”

Section: Abs Language Related Workmentioning

confidence: 99%

Type Systems for Distributed Programs: Components and Sessions

Dardha

2016

Atlantis Studies in Computing

View full text Add to dashboard Cite

Modern software systems, in particular distributed ones, are everywhere around us and are at the basis of our everyday activities. Hence, guaranteeing their correctness, consistency and safety is of paramount importance. Their complexity makes the verification of such properties a very challenging task. It is natural to expect that these systems are reliable and above all usable.i) In order to be reliable, compositional models of software systems need to account for consistent dynamic reconfiguration, i.e., changing at runtime the communication patterns of a program.ii) In order to be useful, compositional models of software systems need to account for interaction, which can be seen as communication patterns among components which collaborate together to achieve a common task.The aim of the Ph.D. was to develop powerful techniques based on formal methods for the verification of correctness, consistency and safety properties related to dynamic reconfiguration and communication in complex distributed systems. In particular, static analysis techniques based on types and type systems appeared to be an adequate methodology, considering their success in guaranteeing not only basic safety properties, but also more sophisticated ones like, deadlock or livelock freedom in a concurrent setting.The main contributions of this dissertation are twofold. i) On the components side: we design types and a type system for a concurrent object-oriented calculus to statically ensure consistency of dynamic reconfigurations related to modifications of communication patterns in a program during execution time.3 ii) On the communication side: we study advanced safety properties related to communication in complex distributed systems like deadlock-freedom, livelockfreedom and progress.Most importantly, we exploit an encoding of types and terms of a typical distributed language, session π-calculus, into the standard typed π-calculus, in order to understand the expressive power of concurrent calculi with structured communication primitives and how they stand with respect to the standard typed concurrent calculi, namely (variants) of typed π-calculus. Then, we show how to derive in the session π-calculus basic properties, like type safety or complex ones, like progress, by encoding.

show abstract

A Component Model for the ABS Language

Cited by 6 publications

References 23 publications

Adaptable processes

Adaptable processes

Variability Modelling in the ABS Language

Type Systems for Distributed Programs: Components and Sessions

Contact Info

Product

Resources

About