Pages that link to "Item:Q1770366"
From MaRDI portal
The following pages link to A compositional approach to CTL\(^*\) verification (Q1770366):
Displaying 19 items.
- Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets (Q442295) (← links)
- Formula-dependent equivalence for compositional CTL model checking (Q698104) (← links)
- Deductive verification of alternating systems (Q939163) (← links)
- On automation of \(\mathsf{CTL}^*\) verification for infinite-state systems (Q1702907) (← links)
- \textsc{LTL} falsification in infinite-state systems (Q2105460) (← links)
- Automatic discovery of fair paths in infinite-state transition systems (Q2147176) (← links)
- On the computation of counterexamples in compositional nonblocking verification (Q2197583) (← links)
- Proving the existence of fair paths in infinite-state systems (Q2234061) (← links)
- Proof-based verification approaches for dynamic properties: application to the information system domain (Q2355384) (← links)
- Completeness and Decidability Results for CTL in Coq (Q2879254) (← links)
- (Q2979814) (← links)
- Pilsner: a compositionally verified compiler for a higher-order imperative language (Q2981953) (← links)
- MODULAR RANKING ABSTRACTION (Q3426785) (← links)
- Compositional Verification and 3-Valued Abstractions Join Forces (Q3611995) (← links)
- (Q4222919) (← links)
- (Q5015366) (← links)
- Proving the Refuted: Symbolic Model Checkers as Proof Generators (Q5187831) (← links)
- Checking Temporal Properties of Discrete, Timed and Continuous Behaviors (Q5452193) (← links)
- A Sound and Complete Deductive System for CTL* Verification (Q5504119) (← links)