Interactive verification of concurrent systems using symbolic execution
From MaRDI portal
Recommendations
- Verifying Concurrent Systems with Symbolic Execution
- scientific article; zbMATH DE number 1324660
- Symbolic execution of concurrent systems using Petri nets
- Verification of concurrent systems with VerCors
- Verifying concurrent systems with symbolic execution. Temporal reasoning is symbolic execution with a little induction.
- Automatic and hierarchical verification for concurrent systems
Cited in
(12)- RGITL: a temporal logic framework for compositional reasoning about interleaved programs
- Compositional reasoning using intervals and time reversal
- An application of temporal projection to interleaving concurrency
- Loop invariant symbolic execution for parallel programs
- Formal verification of a lock-free stack with hazard pointers
- Verifying Concurrent Systems with Symbolic Execution
- PBMC: Symbolic Slicing for the Verification of Concurrent Programs
- scientific article; zbMATH DE number 1324660 (Why is no real title available?)
- Verifying concurrent systems with symbolic execution. Temporal reasoning is symbolic execution with a little induction.
- Proving linearizability with temporal logic
- Completeness of fair ASM refinement
- Automated flaw detection in algebraic specifications
This page was built for publication: Interactive verification of concurrent systems using symbolic execution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3568235)
