Verification of higher-order concurrent programs with dynamic resource creation
From MaRDI portal
Recommendations
- Pairwise reachability analysis for higher order concurrent programs by higher-order model checking
- Programming Languages and Systems
- An integrated specification and verification technique for highly concurrent data structures
- Verification of concurrent programs using Petri net unfoldings
- Safety and Liveness in Concurrent Pointer Programs
Cites work
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Computer Aided Verification
- Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
- Model checking higher-order programs
- Pairwise reachability analysis for higher order concurrent programs by higher-order model checking
- Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Cited in
(5)- A framework for verification and debugging of resource usage properties: resource usage verification
- Correct-by-construction concurrency: using dependent types to verify implementations of effectful resource usage protocols
- Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation
- Pairwise reachability analysis for higher order concurrent programs by higher-order model checking
- Model-checking parametric lock-sharing systems against regular constraints
This page was built for publication: Verification of higher-order concurrent programs with dynamic resource creation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179302)
