Automatic verification for a class of distributed systems
From MaRDI portal
Publication:5137900
Recommendations
Cites work
- scientific article; zbMATH DE number 4028914 (Why is no real title available?)
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- An axiomatic proof technique for parallel programs
- Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis
- Lectures on Petri nets. 1: Basic models. Advances in Petri nets
- Proving Liveness Properties of Concurrent Programs
- Reasoning about networks with many identical finite state processes
- Reasoning about systems with many processes
Cited in
(9)- Verification of distributed systems with local-global predicates
- Mostly Automated Formal Verification of Loop Dependencies with Applications to Distributed Stencil Algorithms
- scientific article; zbMATH DE number 2084333 (Why is no real title available?)
- A suite of tools for debugging distributed autonomous systems
- Theorem Proving in Higher Order Logics
- Verifying autonomous systems
- scientific article; zbMATH DE number 1533829 (Why is no real title available?)
- Automatic Verification of Bossa Scheduler Properties
- Automatic and hierarchical verification for concurrent systems
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)