An automata-theoretic approach to the verification of distributed algorithms

DOI10.1016/j.ic.2017.05.006zbMath1390.68421arXiv1504.06534OpenAlexW815383194MaRDI QIDQ1706162

Benedikt Bollig, C. Aiswarya, Paul Gastin

Publication date: 21 March 2018

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.06534

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15)

Uses Software

• MONA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multi-parameterised compositional verification of safety properties
• Model checking propositional dynamic logic with all extras
• Model Checking Parameterised Multi-token Systems via the Composition Method
• Model Checking Languages of Data Words
• Parameterized Model Checking of Token-Passing Systems
• Algorithmic analysis of array-accessing programs
• Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk).
• On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability
• Two-variable logic on data trees and XML reasoning
• XPath satisfiability in the presence of DTDs
• PDL with intersection and converse: satisfiability and infinite-state model checking
• A Reduction Theorem for the Verification of Round-Based Distributed Algorithms
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
• Computer Science Logic
• Streaming transducers for algorithmic verification of single-pass list-processing programs
• Extending two-variable logic on data trees with order on data values and its automata
• On Verifying Fault Tolerance of Distributed Protocols
• On Reasoning About Rings
• Tools and Algorithms for the Construction and Analysis of Systems
• Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems
• Foundations of Software Science and Computation Structures
• Well-structured transition systems everywhere!

This page was built for publication: An automata-theoretic approach to the verification of distributed algorithms