Sociable Interfaces

Alfaro, Luca de; Silva, Leandro Dias da; Faella, Marco; Legay, Axel; Roy, Pritam; Sorea, Maria

doi:10.1007/11559306_5

Cited by 33 publications

(31 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Like in the work of de Alfaro et al [8] we define specifications with respect to an assertion language allowing suitable predicate representation. Given a set V of variables, we denote by Pred (V ) the set of first-order predicates with free variables in V ; we assume that these predicates are written in some specified first-order language with existential (∃) and universal (∀) quantifiers and with interpreted function symbols and predicates; in our examples, the language contains the usual arithmetic operators and boolean connectives (∨, ∧, ¬, ⇒).…”

Section: Modal Specifications With Datamentioning

confidence: 99%

“…A comparison between modal specifications and other theories such as interface automata [20] and process algebra [2] can be found in [3]. In [8], the authors introduced sociable interfaces, that is a model of I/O automata [21] equipped with a data and a game-based semantics. While their communication primitives are richer, sociable interfaces do not encompass any notion of logical composition and quotient, and their refinement is based on an alternating simulation.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Modal Specification Theory for Components with Data

Bauer

Larsen

Legay

et al. 2012

Formal Aspects of Component Software

Self Cite

View full text Add to dashboard Cite

Abstract. Modal specification is a well-known and widely used formalism used as an abstraction theory for transition systems. Modal specifications are transition systems equipped with two types of transitions: must-transitions that are mandatory to any implementation, and may-transitions that are optional. The duality of transitions allows to develop a unique approach for both logical and structural compositions, and eases the step-wise refinement process for building implementations. We propose Modal Specifications with Data (MSD), the first modal specification theory with explicit representation of data. Our new theory includes all the essential ingredients of a specification theory. As MSD are potentially infinite-state systems, we propose symbolic representations based on effective predicates. Our theory serves as a new abstraction-based formalism for transition systems with data.

show abstract

Section: Modal Specifications With Datamentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

A Modal Specification Theory for Components with Data

Bauer

Larsen

Legay

et al. 2012

Formal Aspects of Component Software

Self Cite

View full text Add to dashboard Cite

show abstract

“…De Alfaro et al [10] have extended Interface Automata to support one-to-many and many-to-one communications. The resulting formalism is called Sociable Interfaces.…”

Section: Related Workmentioning

confidence: 99%

State Space Reduction Techniques for Component Interfaces

Lumpe

Grunske

Schneider

2008

Component-Based Software Engineering

View full text Add to dashboard Cite

Abstract. Automata-based interface and protocol specifications provide an elegant framework to capture and automatically verify the interactive behavior of component-based software systems. Unfortunately, the underlying formalisms suffer from combinatorial state explosion when constructing new specifications for composite components or systems and may therefore render the application of these techniques impractical for real-world applications. In this paper, we explore the bisimulation technique as a means for a mechanical state space reduction of component-based systems. In particular, we apply both strong and weak bisimulation to Component Interaction Automata in order to obtain a minimal automata that can serve as a behavioral equivalent abstraction for a given component specification and illustrate that the proposed approach can significantly reduce the complexity of an interface specification after composition.

show abstract

“…This enables the encoding of rich communication schemes, including exclusive, and many-to-many schemes, and differentiates the modules of Ticc from other modules with more restrictive communication primitives, such as I/O Automata [10] and Reactive Modules [3]. The theory behind Ticc has been presented in [5]; here, we describe the tool itself.…”

Section: Overviewmentioning

confidence: 99%

Ticc: A Tool for Interface Compatibility and Composition

Adler

Alfaro

Silva

et al. 2006

Computer Aided Verification

Self Cite

View full text Add to dashboard Cite

Abstract. We present the tool Ticc (Tool for Interface Compatibility and Composition). In Ticc, a component interface describes both the behavior of a component, and the component's assumptions on the environment's behavior. Ticc can check the compatibility of such interfaces, and analyze their emergent behavior, via a symbolic implementation of game-theoretic algorithms. OverviewOpen systems are systems whose behavior is jointly determined by their internal structure, and by the inputs that they receive from their environment. In previous work, it has been argued that games constitute a natural model for open systems [1,6,7,4,2]. We use games to represent the interaction between the behavior originating within a component, and the behavior originating from the component's environment. In particular, we model components as Input-Output games: the moves of Input represent the behavior the component can accept from the environment, while the moves of Output represent the behavior the component can generate.Unlike component models based on transition systems, models based on games provide a notion of compatibility [6,7,4]. When two components P and Q are composed, we can check whether the output behavior of P satisfies the input requirements of Q, and vice-versa. However, we do not define P and Q to be compatible only if their input requirements are always satisfied. Rather, we recognize that the output behavior of P and Q can still be influenced by their residual interaction with the environment (unless the composition of P and Q is closed). Thus, we define P and Q to be compatible if there is some environment under which their input assumptions are mutually satisfied, and we associate with their composition P Q the weakest (most general) assumptions about the environment that guarantee mutual compatibility. In game-theoretic terms, P

show abstract

Sociable Interfaces

Cited by 33 publications

References 4 publications

A Modal Specification Theory for Components with Data

A Modal Specification Theory for Components with Data

State Space Reduction Techniques for Component Interfaces

Ticc: A Tool for Interface Compatibility and Composition

Contact Info

Product

Resources

About