Convergence Verification: From Shared Memory to Partially Synchronous Systems

DOI10.1007/978-3-540-85778-5_16MaRDI QIDQ3543300zbMATH OpenOpenAlexFDO

Authors K. Mani Chandy, Sayan Mitra, Concetta Pilotto

Publication date 2 December 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-85778-5_16

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Towards Automatic Convergence Verification of Self-stabilizing Algorithms
• On Convergence of Concurrent Systems under Regular Interactions
• A strategy for automatic verification of stabilization of distributed algorithms
• A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem

Cited in

(8)

• Deterministic concurrency: a clock-synchronised shared memory approach
• scientific article; zbMATH DE number 7295368 (Why is no real title available?)
• Towards Automatic Convergence Verification of Self-stabilizing Algorithms
• Verification of distributed systems with local-global predicates
• SMT-based analysis of virtually synchronous distributed hybrid systems
• Parameterized Verification of Asynchronous Shared-Memory Systems
• On Convergence of Concurrent Systems under Regular Interactions
• A Formalized Theory for Verifying Stability and Convergence of Automata in PVS

Describes a project that uses

Uses Software

• PVS

This page was built for publication: Convergence Verification: From Shared Memory to Partially Synchronous Systems

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