The following pages link to (Q4484475):
Displaying 11 items.
- A complete proof system for propositional projection temporal logic (Q391223) (← links)
- A tableau-based decision procedure for CTL\(^*\) (Q432138) (← links)
- Deductive verification of alternating systems (Q939163) (← links)
- A decision procedure and complete axiomatization for projection temporal logic (Q1986563) (← links)
- Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\) (Q1989347) (← links)
- Proof-based verification approaches for dynamic properties: application to the information system domain (Q2355384) (← links)
- An axiomatization of PCTL* (Q2566222) (← links)
- A proof system for unified temporal logic (Q2686105) (← links)
- Completeness and Decidability Results for CTL in Coq (Q2879254) (← links)
- (Q3210192) (← links)
- All-Path Reachability Logic (Q5170834) (← links)