Compositional Verification for Component-Based Systems and Application

Bensalem, Saddek; Bozga, Marius; Sifakis, Joseph; Nguyen, Thanh-Hung

doi:10.1007/978-3-540-88387-6_7

Cited by 85 publications

(74 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In a slightly different application domain, BIP [6,3] is a formal framework that allows building and analyzing complex component-based systems, both synchronous (reactive) or asynchronous (distributed) by coordinating the behaviour of a set of primitive and heterogeneous components. BIP is supported by a tool set including translators from various programming languages as Lustre and C into BIP, a compiler for generating code executable by a dedicated engine, and the verification tool dFinder.…”

Section: Related Approachesmentioning

confidence: 99%

Verifying the correct composition of distributed components: Formalisation and Tool

Henrio

Kulankhina

Liu³

et al. 2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

This article provides formal definitions characterizing well-formed composition of components in order to guarantee their safe deployment and execution. Our work focuses on the structural aspects of component composition; it puts together most of the concepts common to many component models, but never formalized as a whole. Our formalization characterizes correct component architectures made of functional and non-functional aspects, both structured as component assemblies. Interceptor chains can be used for a safe and controlled interaction between the two aspects. Our well-formed components guarantee a set of properties ensuring that the deployed component system has a correct architecture and can run safely. Finally, those definitions constitute the formal basis for our Eclipsebased environment for the development and specification of component-based applications.

show abstract

Section: Related Approachesmentioning

confidence: 99%

Verifying the correct composition of distributed components: Formalisation and Tool

Henrio

Kulankhina

Liu³

et al. 2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…The interaction invariants are computed by the method explained in [12]. Interaction invariants are over-approximations of the global state space allowing us to disregard certain tuples of local states as unreachable.…”

Section: Timed Systems and Propertiesmentioning

confidence: 99%

“…The invariant is given in conjunctive normal form to stick to the formalism in [12,11]. Every disjunction corresponds to the so called notion of "initially marked traps" in an underlying Petri net associated to our model.…”

Section: Timed Systems and Propertiesmentioning

confidence: 99%

See 1 more Smart Citation

Compositional Verification for Timed Systems Based on Automatic Invariant Generation

Aştefănoaei¹,

Rayana²,

Bensalem³

et al. 2015

Logical Methods in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We propose a method for compositional verification to address the state space explosion problem inherent to model-checking timed systems with a large number of components. The main challenge is to obtain pertinent global timing constraints from the timings in the components alone. To this end, we make use of auxiliary clocks to automatically generate new invariants which capture the constraints induced by the synchronisations between components. The method has been implemented in the RTDFinder tool and successfully experimented on several benchmarks.

show abstract

“…Contributions of the paper are: (i) a uniform Horn clause encoding for systems with (finite or infinite) concurrency, real-time constraints, as well as inter-process communication using shared memory, synchronous message passing, and synchronisation using barriers; the encoding can be applied, among others, to Uppaal timed automata [20] and BIP [4]; (ii) an experimental evaluation using a set of (wellknown) parametric timed automata models.…”

Section: Introductionmentioning

confidence: 99%

Horn Clauses for Communicating Timed Systems

Hojjat

Rümmer

Subotić

et al. 2014

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Languages based on the theory of timed automata are a well established approach for modelling and analysing real-time systems, with many applications both in industrial and academic context. Model checking for timed automata has been studied extensively during the last two decades; however, even now industrial-grade model checkers are available only for few timed automata dialects (in particular Uppaal timed automata), exhibit limited scalability for systems with large discrete state space, or cannot handle parametrised systems. We explore the use of Horn constraints and off-the-shelf model checkers for analysis of networks of timed automata. The resulting analysis method is fully symbolic and applicable to systems with large or infinite discrete state space, and can be extended to include various language features, for instance Uppaal-style communication/broadcast channels and BIP-style interactions, and systems with infinite parallelism. Experiments demonstrate the feasibility of the method.Comment: In Proceedings HCVS 2014, arXiv:1412.082

show abstract

Compositional Verification for Component-Based Systems and Application

Cited by 85 publications

References 19 publications

Verifying the correct composition of distributed components: Formalisation and Tool

Verifying the correct composition of distributed components: Formalisation and Tool

Compositional Verification for Timed Systems Based on Automatic Invariant Generation

Horn Clauses for Communicating Timed Systems

Contact Info

Product

Resources

About