The automatic detection of token structures and invariants using SAT checking
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- A Proof System for Communicating Sequential Processes
- Analyzing component-based systems on the basis of architectural constraints
- FDR3 -- a modern refinement checker for CSP
- Lazy reachability analysis in distributed systems
- Proving the Correctness of Multiprocess Programs
- Rigorous development of component-based systems using component metadata and patterns
- Tighter reachability criteria for deadlock-freedom analysis
- Understanding concurrent systems
- Verification, Model Checking, and Abstract Interpretation
Cited in
(3)
This page was built for publication: The automatic detection of token structures and invariants using SAT checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3303932)