Local Reasoning about Parametric and Reconfigurable Component-based Systems
Marius Bozga, Radu Iosif, Joseph Sifakis

TL;DR
This paper presents a logical framework for specifying and verifying parametric, reconfigurable component-based systems, enabling modular reasoning and scalable verification for systems with dynamic component migration and unknown bounds.
Contribution
It introduces resource logics inspired by Separation Logic for local reasoning about parametric and reconfigurable architectures, facilitating modular specifications and scalable verification.
Findings
Supports reasoning about systems with unknown component bounds
Enables dynamic reconfiguration and migration of components
Facilitates scalable verification of large industrial systems
Abstract
We introduce a logical framework for the specification and verification of component-based systems, in which finitely many component instances are active, but the bound on their number is not known. Besides specifying and verifying parametric systems, we consider the aspect of dynamic reconfiguration, in which components can migrate at runtime on a physical map, whose shape and size may change. We describe such parametric and reconfigurable architectures using resource logics, close in spirit to Separation Logic, used to reason about dynamic pointer structures. These logics support the principle of local reasoning, which is the key for writing modular specifications and building scalable verification algorithms, that deal with large industrial-size systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Model-Driven Software Engineering Techniques · Logic, programming, and type systems
