• Corpus ID: 14401150

Formal Modeling and Analysis of a Distributed Database Protocol in Maude

@article{lveczky2008FormalMA,
  title={Formal Modeling and Analysis of a Distributed Database Protocol in Maude},
  author={Peter Csaba {\~O}lveczky},
  journal={2008 11th IEEE International Conference on Computational Science and Engineering - Workshops},
  year={2008},
  pages={37-44}
}
  • P. C. Õlveczky
  • Published 2008
  • Computer Science
  • 2008 11th IEEE International Conference on Computational Science and Engineering - Workshops
This paper illustrates how the rewriting-logic-based Maude tool, and its extension real-time Maude, can be applied to the formal object-oriented specification, simulation, and model checking of the two-phase commit protocol for distributed databases. Maude's intuitive yet expressive specification language, its support for object-oriented formal specification, its high-performance formal analysis features, and its track record should make it a promising candidate to successfully analyze advanced… 

Formal Modeling and Analysis of a Distributed Transaction Protocol in UPPAAL

A formal analysis of the well-known two phase atomic commitment protocol, modeled as networks of timed automata using the model checker UPPAAL, shows that the specification language of the tool lacks the expressiveness to capture some desired properties of the protocol.

A Comparative Study of Decision Diagrams for Real-Time Model Checking

This paper model and verify the distributed timed two phase commit protocol and two well-known benchmarks, the Token-Ring-FDDI protocol, and the CSMA/CD protocol, in three different state-of-the-art real-time model checkers: UPPAAL, RED, and Rabbit.

Epistemic Model Checking of Atomic Commitment Protocols with Byzantine Failures

The two phase commit protocol is formulates as a knowledge-based program and then an iterative process of model checking and counter-example guided refinement is followed to find concrete implementations of the program for the case of perfect recall semantic in the Byzantine failures context with synchronous reliable communication.

Rewriting logic bibliography by topic: 1990-2011

Epistemic Model Checking of Distributed Commit Protocols with Byzantine Faults

The two phase commit protocol is formulates as a knowledge-based program and then an iterative process of model checking and counter-example guided refinement is followed to find concrete implementations of the program for the case of perfect recall semantic in the Byzantine failures context with synchronous reliable communication.

Verifying Real-time Commit Protocols Using Dense-time Model Checking Technology

This paper model and verify the well-known timed two phase commit protocol in three different state-of-the-art real-time model checkers: UPPAAL, Rabbit, and RED, and compare the results.

References

SHOWING 1-10 OF 17 REFERENCES

The Real-Time Maude Tool

Real-Time Maude is a rewriting-logic-based tool supporting the formal specification and analysis of real-time systems. Our tool emphasizes expressiveness and ease of specification over algorithmic

Formal modeling and analysis of real-time resource-sharing protocols in Real-Time Maude

This paper presents general techniques for formally modeling, simulating, and model checking real-time resource-sharing protocols in Real-Time Maude and shows how the general techniques can be instantiated to model and analyze the well known priority inheritance protocol.

Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude

The experience shows that Real-Time Maude is well-suited to meet the AER/NCA modeling challenges, and that its methods have proved effective in uncovering subtle and important errors in the informal use case specification.

Semantics and pragmatics of Real-Time Maude

This paper describes both the semantics of Real-Time Maude specifications, and of the formal analyses supported by the tool, and explains the tool's pragmatics, both in the use of its features, and in its application to concrete examples.

Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery

The book gives both a comprehensive overview and an in-depth presentation of the field of transactional data processing covering the latest findings of the research community as well as practical

Membership algebra as a logical framework for equational specification

The paper presents the basic properties of the logic and its models, and discusses in detail how many total and partial equational specification formalisms can be represented in it, as well as the practical benefits in terms of tool reusability that this opens up for other languages, including CASL.

Rewriting logic: roadmap and bibliography

Crash Recovery in a Distributed Data Storage System

An algorithm is described which guarantees reliable storage of data in a distributed system, even when different portions of the data base, stored on separate machines, are updated as part of a

Formal Modeling and Analysis of the OGDC Wireless Sensor Network Algorithm in Real-Time Maude

The application of Real-Time Maude to the formal specification, simulation, and further formal analysis of the sophisticated state-of-the-art OGDC wireless sensor network algorithm seems to provide a much more accurate estimate of the performance of OGDC than the ns-2 simulations.

A Systematic Approach to Uncover Security Flaws in GUI Logic

Based on an in-depth study of key subsets of Internet Explorer (IE) browser source code, a formal model for the browser GUI logic is developed and formal reasoning is applied to uncover new spoofing scenarios, including nine for status bar spoofing and four for addressbar spoofing.