Verifying temporal properties using explicit approximants: Completeness for context-free processes
From MaRDI portal
Recommendations
Cited in
(10)- Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS
- Past is for free: On the complexity of verifying linear temporal properties with past
- QBF Encoding of Temporal Properties and QBF-Based Verification
- Reducing behavioural to structural properties of programs with procedures
- Verifying temporal properties of sequential machines without building their state diagrams
- Verification of temporal properties of processes in a setting with data
- On global induction mechanisms in aμ-calculus with explicit approximations
- Automatically verifying temporal properties of pointer programs with cyclic proof
- Proof systems for two-way modal -calculus
- The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
This page was built for publication: Verifying temporal properties using explicit approximants: Completeness for context-free processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4738238)