On Accurate Automatic Verification of Publish-Subscribe Architectures

Baresi, Luciano; Ghezzi, Carlo; Mottola, Luca

doi:10.1109/icse.2007.57

Cited by 44 publications

(40 citation statements)

References 20 publications

(38 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper builds on the previous efforts of some of the authors [4,5,6] by extending the formal analysis of publish-subscribe systems in a probabilistic setting. In [4], application components are modeled as UML statechart diagrams while the communication infrastructure is supplied as a configurable predefined component.…”

Section: Related Workmentioning

confidence: 97%

“…UML statechart diagrams are translated into Promela and validated through the SPIN model checker. While this approach builds on top of an existing model checker, [5,6] extend the Bogor model checker and the communication mechanisms of publish-subscribe infrastructures are embedded in it. Some domain-specific knowledge is used to reduce the state space.…”

Section: Related Workmentioning

confidence: 99%

“…Among the many attempts [4,5,6,7,8,9, 10] to model and validate publishsubscribe systems, model checking has been considered as an attractive solution. However, all these works assume deterministic systems and neglect the uncertainty that characterize practical publish-subscribe applications.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata

Baresi

Ghezzi

et al. 2007

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The publish-subscribe architectural style has recently emerged as a promising approach to tackle the dynamism of modern distributed applications. The correctness of these applications does not only depend on the behavior of each component in isolation, but the interactions among components and the delivery infrastructure play key roles. This paper presents the first results on considering the validation of these applications in a probabilistic setting. We use probabilistic model checking techniques on stochastic models to tackle the uncertainty that is embedded in these systems. The communication infrastructure (i.e., the transmission channels and the publish-subscribe middleware) are modeled directly by means of probabilistic timed automata. Application components are modeled by using statechart diagrams and then translated into probabilistic timed automata. The main elements of the approach are described through an example.

show abstract

Section: Related Workmentioning

confidence: 97%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata

Baresi

Ghezzi

et al. 2007

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…In our discussion, we use of Bogor's basic constructs, which should be easily understandable since they are similar to those commonly provided by existing model checker. The reader can refer to [5], [54] for more details. Figure 1 illustrates the preamble that must be included in all Bogor models using Loupe.…”

Section: Loupementioning

confidence: 99%

“…This article provides a comprehensive treatment of our work on the accurate verification of P/S architectures -whose initial results appeared in [3]- [5]-by presenting a thorough description and evaluation of Loupe in its most mature form. The current version of our tool features more accurate and detailed models of P/S systems, provides a stronger foundation for the correctness of the results obtained, and improves in the performance of verification.…”

Section: Introductionmentioning

confidence: 99%

Loupe: Verifying Publish-Subscribe Architectures with a Magnifying Lens

Baresi

Ghezzi

Mottola

2011

IIEEE Trans. Software Eng.

Self Cite

View full text Add to dashboard Cite

Abstract-The Publish-Subscribe (P/S) communication paradigm fosters high decoupling among distributed components. This facilitates the design of dynamic applications, but also impacts negatively on their verification, making it difficult to reason on the overall federation of components. In addition, existing P/S infrastructures offer radically different features to the applications, e.g., in terms of message reliability. This further complicates the verification, as its outcome depends on the specific guarantees provided by the underlying P/S system. Although model checking has been proposed as a tool for the verification of P/S architectures, existing solutions overlook many characteristics of the underlying communication infrastructure to avoid state explosion problems.To overcome these limitations, the Loupe domain-specific model checker adopts a different approach. The P/S infrastructure is not modeled on top of a general-purpose model checker. Instead, it is embedded within the checking engine, and the traditional P/S operations become part of the modeling language. In this article, we describe Loupe's design and the dedicated state abstractions that enable accurate verification without incurring in state explosion problems. We also illustrate our use of state-ofthe-art software verification tools to assess some key functionality in Loupe's current implementation. A complete case study shows how Loupe eases the verification of P/S architectures. Finally, we quantitatively compare Loupe's performance against alternative approaches. The results indicate that Loupe is effective and efficient in enabling accurate verification of P/S architectures.

show abstract

Quality of service in IoT protocol as designs and its verification in PVS

Nawaz

Sun

Shahzad

et al. 2019

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Reliable data transmission during communication in Internet of things (IoT)–based systems has gained much interest in last few years due to the current growth and huge investment in such systems. Message Queue Telemetry Transport (MQTT) is an open publish/subscribe–based messaging protocol that is widely used for device communication in IoT. For data transmission between devices, different levels of quality of service (QoS) are used in MQTT. In this paper, we provide a formal model for MQTT protocol under the Unifying Theories of Programming (UTP) semantic framework, where QoS levels in MQTT are modeled as designs in UTP. Refinement and equivalence relations between QoS levels can be established naturally via implication between predicates. Moreover, Prototype Verification System (PVS) is used to encode the UTP design models and some important properties as well as the refinement relation between QoS levels is proved with the PVS proof assistant.

show abstract

On Accurate Automatic Verification of Publish-Subscribe Architectures

Cited by 44 publications

References 20 publications

Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata

Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata

Loupe: Verifying Publish-Subscribe Architectures with a Magnifying Lens

Quality of service in IoT protocol as designs and its verification in PVS

Contact Info

Product

Resources

About