Local model checking for context-free processes
From MaRDI portal
Recommendations
Cites work
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Computing behavioural relations, logically
- scientific article; zbMATH DE number 4131643 (Why is no real title available?)
- scientific article; zbMATH DE number 52748 (Why is no real title available?)
- Proof systems for satisfiability in Hennessy-Milner logic with recursion
- Results on the propositional \(\mu\)-calculus
- Tableau-based model checking in the propositional mu-calculus
Cited in
(10)- A novel approach to verifying context free properties of programs
- Complete SAT-Based Model Checking for Context-Free Processes
- COMPLETE SAT-BASED MODEL CHECKING FOR CONTEXT-FREE PROCESSES
- Local model checking for value-passing processes. (Extended abstract)
- Demand-driven model checking for context-free processes
- Verifying temporal properties using explicit approximants: Completeness for context-free processes
- scientific article; zbMATH DE number 751138 (Why is no real title available?)
- Towards nominal context-free model-checking
- Symbolic reachability analysis of higher-order context-free processes
- A novel approach to verifying context free properties of programs
This page was built for publication: Local model checking for context-free processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630295)