Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms

DOI10.1007/978-3-540-73147-4_11zbMATH Open1186.68430OpenAlexW1489401424MaRDI QIDQ3608819FDOQ3608819

Authors: Abdessamad Imine, Michaël Rusinowitch 

Publication date: 6 March 2009

Published in: Rewriting, Computation and Proof (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73147-4_11

Recommendations

• Formal design and verification of operational transformation algorithms for copies convergence
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• scientific article
• Verified Operational Transformation for Trees
• Algebraic Methodology and Software Technology

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (4)

• Formal design and verification of operational transformation algorithms for copies convergence
• Verifying eventual consistency of optimistic replication systems
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Algebraic Methodology and Software Technology

This page was built for publication: Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608819)