Reachability analysis on distributed executions

DOI10.1007/3-540-56610-4_94zbMATH Open1497.68097OpenAlexW1571953574MaRDI QIDQ5044769FDOQ5044769

Authors: Claire Diehl, Claude Jard, Jean-Xavier Rampon 

Publication date: 2 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56610-4_94

Recommendations

• scientific article; zbMATH DE number 4050940
• A work-efficient distributed algorithm for reachability analysis
• Lazy reachability analysis in distributed systems
• A work-efficient distributed algorithm for reachability analysis.
• Distributed algorithms for time optimal reachability analysis
• The complexity of reachability in distributed communicating processes
• On-the-fly analysis of distributed computations

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Time, clocks, and the ordering of events in a distributed system
• Title not available (Why is that?)
• Interval approximations of message causality in distributed executions
• An extended arithmetic
• Calcul des idéaux d'un ordonné fini
• Title not available (Why is that?)

Cited In (16)

• Shared global states in distributed computations
• A formal approach to property testing in causally consistent distributed traces
• Precisely deciding control state reachability in concurrent traces with limited observability
• Reaching and Distinguishing States of Distributed Systems
• Measuring concurrency of regular distributed computations
• Title not available (Why is that?)
• Testing Distributed Systems Through Symbolic Model Checking
• An efficient algorithm for computing causal trace sets in causality checking
• Faster possibility detection by combining two approaches
• A work-efficient distributed algorithm for reachability analysis
• Quantitative static analysis of distributed systems
• Testing for race conditions in distributed systems via SMT solving
• Efficient online algorithm for identifying useless states in distributed systems
• The automatic detection of token structures and invariants using SAT checking
• Efficient algorithms on distributive lattices
• On-the-fly analysis of distributed computations

This page was built for publication: Reachability analysis on distributed executions

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