ABSTRACT
Configuration logics have been proposed for the specification of architectural styles of component-based systems. We use such a logic for the specification and verification of architectural properties of dynamic reconfigurable systems. In particular, we introduce the Temporal Configuration Logic (TCL), a linear time temporal logic built from atomic formulas characterizing system configurations and temporal modalities. We study an effective model-checking procedure based on SMT techniques for a non-trivial fragment of TCL which has been implemented in a prototype runtime verification tool. We provide preliminary experimental results illustrating the capabilities of the tool on two non-trivial benchmark systems.
- Nazareno Aguirre and T. S. E. Maibaum. 2002. A Temporal Logic Approach to the Specification of Reconfigurable Component-Based Systems. In 17th IEEE International Conference on Automated Software Engineering (ASE 2002). IEEE Computer Society, 271--274.Google ScholarCross Ref
- Rim El Ballouli, Saddek Bensalem, Marius Bozga, and Joseph Sifakis. 2018. Programming Dynamic Reconfigurable Systems. In Formal Aspects of Component Software - 15th International Conference, FACS 2018, Proceedings (LNCS), Kyungmin Bae and Peter Csaba Ölveczky (Eds.), Vol. 11222. Springer, 118--136.Google Scholar
- Andreas Bauer, Martin Leucker, and Christian Schallhart. 2011. Runtime Verification for LTL and TLTL. ACM Trans. Softw. Eng. Methodol. 20, 4 (2011), 14.Google ScholarDigital Library
- Antonio Bucchiarone and Juan P. Galeotti. 2008. Dynamic Software Architectures Verification using DynAlloy. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 10 (2008).Google Scholar
- Julien Dormoy, Olga Kouchnarenko, and Arnaud Lanoix. 2010. Using Temporal Logic for Dynamic Reconfigurations of Components. In Formal Aspects of Component Software - 7th International Workshop, FACS 2010, Revised Selected Papers (LNCS), Luís Soares Barbosa and Markus Lumpe (Eds.), Vol. 6921. Springer, 200--217.Google Scholar
- Antoine El-Hokayem, Saddek Bensalem, Marius Bozga, and Joseph Sifakis. 2020. A Layered Implementation of DR-BIP Supporting Run-Time Monitoring and Analysis. In Software Engineering and Formal Methods - 18th International Conference, SEFM 2020, Proceedings (LNCS), Frank S. de Boer and Antonio Cerone (Eds.), Vol. 12310. Springer, 284--302.Google Scholar
- Yliès Falcone, Jean-Claude Fernandez, and Laurent Mounier. 2012. What can you verify and enforce at runtime? Int. J. Softw. Tools Technol. Transf. 14, 3 (2012), 349--382.Google ScholarDigital Library
- Ioannis Georgiadis, Jeff Magee, and Jeff Kramer. 2002. Self-organising software architectures for distributed systems. In Proceedings of the First Workshop on Self-Healing Systems, WOSS 2002, David Garlan, Jeff Kramer, and Alexander L. Wolf (Eds.). ACM, 33--38.Google ScholarDigital Library
- Dan Hirsch, Paola Inverardi, and Ugo Montanari. 1999. Modeling Software Architecutes and Styles with Graph Grammars and Constraint Solving. In Software Architecture, TC2 First Working IFIP Conference on Software Architecture (WICSA1) (IFIP Conference Proceedings), Patrick Donohoe (Ed.), Vol. 140. Kluwer, 127--144.Google Scholar
- Institute for Software Engineering and Programming Languages, University of Lübeck. 2020. LamaConv - Logics and Automata Converter Library. https://www.isp.uni-luebeck.de/lamaconv.Google Scholar
- Daniel Jackson. 2002. Alloy: a lightweight object modelling notation. ACM Trans. Softw. Eng. Methodol. 11, 2 (2002), 256--290.Google ScholarDigital Library
- Jung Soo Kim and David Garlan. 2010. Analyzing architectural styles. J. Syst. Softw. 83, 7 (2010), 1216--1235.Google ScholarDigital Library
- Gergely Kovásznai, Andreas Fröhlich, and Armin Biere. 2012. On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width. In 10th International Workshop on Satisfiability Modulo Theories, SMT 2012 (EPiC Series in Computing), Pascal Fontaine and Amit Goel (Eds.), Vol. 20. EasyChair, 44--56.Google Scholar
- Gergely Kovásznai, Andreas Fröhlich, and Armin Biere. 2016. Complexity of Fixed-Size Bit-Vector Logics. Theory Comput. Syst. 59, 2 (2016), 323--376.Google ScholarDigital Library
- Arnaud Lanoix, Julien Dormoy, and Olga Kouchnarenko. 2011. Combining Proof and Model-checking to Validate Reconfigurable Architectures. Electron. Notes Theor. Comput. Sci. 279, 2 (2011), 43--57.Google ScholarDigital Library
- Diego Marmsoler and Mario Gleirscher. 2016. On Activation, Connection, and Behavior in Dynamic Architectures. Sci. Ann. Comput. Sci. 26, 2 (2016), 187--248.Google Scholar
- Anastasia Mavridou, Eduard Baranov, Simon Bliudze, and Joseph Sifakis. 2017. Configuration logics: Modeling architecture styles. J. Log. Algebraic Methods Program. 86, 1 (2017), 2--29.Google ScholarCross Ref
- Daniel Le Métayer. 1998. Describing Software Architecture Styles Using Graph Grammars. IEEE Trans. Software Eng. 24, 7 (1998), 521--533.Google ScholarDigital Library
- Maria Pittou and George Rahonis. 2020. Architecture Modelling of Parametric Component-Based Systems. In Coordination Models and Languages - 22nd IFIP WG 6.1 International Conference, COORDINATION 2020, Proceedings (LNCS), Simon Bliudze and Laura Bocchi (Eds.), Vol. 12134. Springer, 281--300.Google Scholar
- Amir Pnueli. 1977. The Temporal Logic of Programs. In 18th Annual Symposium on Foundations of Computer Science, 1977. IEEE Computer Society, 46--57.Google Scholar
- Amir Pnueli and Aleksandr Zaks. 2006. PSL Model Checking and Run-Time Verification Via Testers. In FM 2006: Formal Methods, 14th International Symposium on Formal Methods, Proceedings (LNCS), Jayadev Misra, Tobias Nipkow, and Emil Sekerinski (Eds.), Vol. 4085. Springer, 573--586.Google Scholar
- Gustavo Sousa, Walter Rudametkin, and Laurence Duchien. 2017. Extending Dynamic Software Product Lines with Temporal Constraints. In 12th IEEE/ACM International Symposium on Software Engineering for Adaptive and Self-Managing Systems, SEAMS@ICSE 2017. IEEE Computer Society, 129--139.Google Scholar
- Jos Warmer and Anneke Kleppe. 1998. The Object Constraint Language: Precise Modeling With UML. Addison-Wesley.Google Scholar
Index Terms
- A temporal configuration logic for dynamic reconfigurable systems
Recommendations
A framework for the specification and validation of dynamic reconfigurable systems
We study a framework for the specification and validation of dynamic reconfigurable systems. The framework is based on configuration logic for the description of architecture styles which are families of architectures sharing common connectivity ...
Constructive linear-time temporal logic: Proof systems and Kripke semantics
In this paper we study a version of constructive linear-time temporal logic (LTL) with the ''next'' temporal operator. The logic is originally due to Davies, who has shown that the proof system of the logic corresponds to a type system for binding-time ...
Expressing and Verifying Business Contracts with Abductive Logic Programming
SCIFF is a declarative language, based on abductive logic programming, that accommodates forward rules, predicate definitions, and constraints over finite domain variables. Its abductive declarative semantics can be related to that of deontic operators; ...
Comments