On automation of CTL^* verification for infinite-state systems
From MaRDI portal
Publication:1702907
Recommendations
Cited in
(16)- A compositional approach to CTL^* verification
- Temporal prophecy for proving temporal properties of infinite-state systems
- Learning to verify branching time properties
- CTL-property transformations along an incremental design process
- scientific article; zbMATH DE number 1927551 (Why is no real title available?)
- Verifying increasingly expressive temporal logics for infinite-state systems
- Efficient CTL verification via Horn constraints solving
- The virtues of idleness: a decidable fragment of resource agent logic
- Fold/unfold transformations for fixpoint logic
- Making prophecies with decision predicates
- Abstraction refinement and antichains for trace inclusion of infinite state systems
- Automatically verifying temporal properties of pointer programs with cyclic proof
- Inference of ranking functions for proving temporal properties by abstract interpretation
- Constraint automata on infinite data trees: from \(\mathrm{CTL}(\mathbb{Z})/\mathrm{CTL}^*(\mathbb{Z})\) to decision procedures
- Constraint automata on infinite data trees: from CTL\((\mathbb{Z})\text{CTL}^*(\mathbb{Z})\) to decision procedures
- Lower-bound synthesis using loop specialization and Max-SMT
This page was built for publication: On automation of \(\mathsf{CTL}^*\) verification for infinite-state systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702907)