Verification of parameterized concurrent programs by modular reasoning about data and control
From MaRDI portal
Recommendations
- Modular verification for shared-variable concurrent programs
- Modular verification of concurrent programs via sequential model checking
- A perspective on specifying and verifying concurrent modules
- Specification and verification of concurrent programs through refinements
- Modular verification of concurrency-aware linearizability
- Verification of fine-grain concurrent programs
- Verification of concurrent programs: The automata-theoretic framework
- Modular verification of multithreaded programs
Cited in
(11)- A tree-based approach to data flow proofs
- Verification of concurrent programs using Petri net unfoldings
- Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems
- Compositional reasoning
- PBMC: Symbolic Slicing for the Verification of Concurrent Programs
- Abstract threads
- Parametrized invariance for infinite state processes
- Verification by Parallelization of Parametric Code
- Clustered relational thread-modular abstract interpretation with local traces
- Thread-modular counter abstraction: automated safety and termination proofs of parameterized software by reduction to sequential program verification
- Lost in abstraction: monotonicity in multi-threaded programs
This page was built for publication: Verification of parameterized concurrent programs by modular reasoning about data and control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942881)