Automatic verification for a class of distributed systems
From MaRDI portal
Publication:5137900
DOI10.1007/PL00008915zbMATH Open1448.68347MaRDI QIDQ5137900FDOQ5137900
Authors: Gabriele Manduchi, M. A. Moro 
Publication date: 3 December 2020
Published in: Distributed Computing (Search for Journal in Brave)
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Reasoning about systems with many processes
- Reasoning about networks with many identical finite state processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- An axiomatic proof technique for parallel programs
- Lectures on Petri nets. 1: Basic models. Advances in Petri nets
- Proving Liveness Properties of Concurrent Programs
- Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis
Cited In (9)
- Verification of distributed systems with local-global predicates
- Mostly Automated Formal Verification of Loop Dependencies with Applications to Distributed Stencil Algorithms
- Title not available (Why is that?)
- Theorem Proving in Higher Order Logics
- A suite of tools for debugging distributed autonomous systems
- Verifying autonomous systems
- Title not available (Why is that?)
- Automatic Verification of Bossa Scheduler Properties
- Automatic and hierarchical verification for concurrent systems
Uses Software
This page was built for publication: Automatic verification for a class of distributed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137900)
