Inproceedings4271805653: Unterschied zwischen den Versionen

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
(Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Christel |ErsterAutorNachname=Baier |FurtherAuthors=Joachim Klein; Sascha Klüppelholz}} {{Inproceedings |Booktitle=Proc. of the 11th International School on Formal Methods for the Design of Computer, Communication and Software Systems (SFM) |Pages=114--147 |Publisher=Springer |Series=Lecture Notes in Computer Science |Title=Modeling and Verification of Components and Connectors |Volume=6659 |Year=…“)
 
Johannes Lehmann (Diskussion | Beiträge)
K (Textersetzung - „Verifikation und formale quantitative Analyse“ durch „Algebraische und logische Grundlagen der Informatik“)
 
Zeile 15: Zeile 15:
|DOI Name=10.1007/978-3-642-21455-4_4
|DOI Name=10.1007/978-3-642-21455-4_4
|Abstract=Component-based software engineering divides a complex system into smaller logical components with well-defined interfaces. To likewise make the complex interactions between components explicit, exogenous coordination languages like Reo allow the construction of complex coordination glue code in the form of networks of channels and connectors, orchestrating the interactions of the components. In this paper, we present an overview of the modeling concepts for components and connectors using Reo and the underlying constraint automata framework and detail the specification and verification of properties using logics tailored to this framework.
|Abstract=Component-based software engineering divides a complex system into smaller logical components with well-defined interfaces. To likewise make the complex interactions between components explicit, exogenous coordination languages like Reo allow the construction of complex coordination glue code in the form of networks of channels and connectors, orchestrating the interactions of the components. In this paper, we present an overview of the modeling concepts for components and connectors using Reo and the underlying constraint automata framework and detail the specification and verification of properties using logics tailored to this framework.
|Forschungsgruppe=Verifikation und formale quantitative Analyse
|Forschungsgruppe=Algebraische und logische Grundlagen der Informatik
}}
}}

Aktuelle Version vom 5. März 2025, 15:43 Uhr

Toggle side column

Modeling and Verification of Components and Connectors

Christel BaierChristel Baier,  Joachim KleinJoachim Klein,  Sascha KlüppelholzSascha Klüppelholz
Christel Baier, Joachim Klein, Sascha Klüppelholz
Modeling and Verification of Components and Connectors
Proc. of the 11th International School on Formal Methods for the Design of Computer, Communication and Software Systems (SFM), volume 6659 of Lecture Notes in Computer Science, 114--147, 2011. Springer
  • KurzfassungAbstract
    Component-based software engineering divides a complex system into smaller logical components with well-defined interfaces. To likewise make the complex interactions between components explicit, exogenous coordination languages like Reo allow the construction of complex coordination glue code in the form of networks of channels and connectors, orchestrating the interactions of the components. In this paper, we present an overview of the modeling concepts for components and connectors using Reo and the underlying constraint automata framework and detail the specification and verification of properties using logics tailored to this framework.
  • Forschungsgruppe:Research Group: Algebraische und logische Grundlagen der InformatikAlgebraic and Logical Foundations of Computer Science
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-21455-4_4.
@inproceedings{BKK2011,
  author    = {Christel Baier and Joachim Klein and Sascha Kl{\"{u}}ppelholz},
  title     = {Modeling and Verification of Components and Connectors},
  booktitle = {Proc. of the 11th International School on Formal Methods for the
               Design of Computer, Communication and Software Systems (SFM)},
  series    = {Lecture Notes in Computer Science},
  volume    = {6659},
  publisher = {Springer},
  year      = {2011},
  pages     = {114--147},
  doi       = {10.1007/978-3-642-21455-4_4}
}