Verification of distributed systems with local-global predicates
From MaRDI portal
Publication:432134
DOI10.1007/S00165-010-0150-7zbMath1242.68155OpenAlexW1971574289MaRDI QIDQ432134
Jerome White, K. Mani Chandy, Concetta Pilotto, Sayan Mitra, Brian Go
Publication date: 3 July 2012
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-010-0150-7
Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14)
Related Items (1)
Uses Software
Cites Work
- A theoretical basis for stepwise refinement and the programming calculus
- Switching in systems and control
- TAME: Using PVS strategies for special-purpose theorem proving
- Superposition refinement of reactive systems
- Stability of motion
- Chaotic relaxation
- Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
- A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
- On the stability of asynchronous iterative processes
- Towards consensus: some convergence theorems on repeated averaging
- The B-Book
- Consensus and Cooperation in Networked Multi-Agent Systems
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- A constructive approach to the problem of program correctness
- Program development by stepwise refinement
- Formal Modeling and Analysis of Timed Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Verification of distributed systems with local-global predicates