Reachability analysis on distributed executions

DOI10.1007/3-540-56610-4_94MaRDI QIDQ5044769zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3786843 (Why is no real title available?)
• scientific article; zbMATH DE number 139793 (Why is no real title available?)
• An extended arithmetic
• Calcul des idéaux d'un ordonné fini
• Interval approximations of message causality in distributed executions
• Time, clocks, and the ordering of events in a distributed system

Cited in

(16)

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

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)