Abstract reduction in directed model checking CCS processes
From MaRDI portal
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
- Formal verification of concurrent systems via directed model checking
- Using heuristic search for finding deadlocks in concurrent systems
- Reduced models for efficient CCS verification
- Automated Technology for Verification and Analysis
- Compositionality and locality for improving model checking in the selective mu-calculus
Cites work
- scientific article; zbMATH DE number 438994 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 177511 (Why is no real title available?)
- scientific article; zbMATH DE number 734956 (Why is no real title available?)
- scientific article; zbMATH DE number 1746648 (Why is no real title available?)
- scientific article; zbMATH DE number 4119603 (Why is no real title available?)
- scientific article; zbMATH DE number 2087636 (Why is no real title available?)
- scientific article; zbMATH DE number 2102708 (Why is no real title available?)
- Abstractions and pattern databases: the quest for succinctness and accuracy
- An introduction to the \(\pi\)-calculus.
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Efficient verification of a multicast protocol for mobile computing
- Formal verification of concurrent systems via directed model checking
- Graph-Based Algorithms for Boolean Function Manipulation
- Guided model checking with a Bayesian meta-heuristic
- Local model checking in the modal mu-calculus
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Selective mu-calculus and formula-based equivalence of transition systems
- \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes
Cited in
(6)- \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes
- A local approach for temporal model checking of Java bytecode
- Formal verification of concurrent systems via directed model checking
- Using heuristic search for finding deadlocks in concurrent systems
- Extended beam search for non-exhaustive state space analysis
- Reduced models for efficient CCS verification
This page was built for publication: Abstract reduction in directed model checking CCS processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715051)
