Concurrent software verification with states, events, and deadlocks
From MaRDI portal
(Redirected from Publication:2432214)
Recommendations
Cited in
(14)- Simulation for lattice-valued doubly labeled transition systems
- Partial Order Reduction for State/Event LTL
- A formal model for service-oriented interactions
- State/Event Software Verification for Branching-Time Specifications
- Partial order reduction for state/event LTL with application to component-interaction automata
- SAT-solving in CSP trace refinement
- A rewriting-based model checker for the linear temporal logic of rewriting
- Deadlock and starvation free reentrant readers-writers: a case study combining model checking with theorem proving
- Tighter reachability criteria for deadlock-freedom analysis
- Using heuristic search for finding deadlocks in concurrent systems
- Local Nontermination Detection for Parallel C++ Programs
- Verification, Model Checking, and Abstract Interpretation
- Automated compositional abstraction refinement for concurrent C programs: a two-level approach
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving
This page was built for publication: Concurrent software verification with states, events, and deadlocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432214)