Pages that link to "Item:Q1176250"
From MaRDI portal
The following pages link to A note on model checking the modal \(\nu\)-calculus (Q1176250):
Displayed 9 items.
- Expressiveness and complexity of graph logic (Q870359) (← links)
- Canonical completeness of infinitary \(\mu \) (Q941442) (← links)
- A compositional \(\mu\)-calculus proof system for statecharts processes (Q1285661) (← links)
- Proving properties of dynamic process networks (Q1383156) (← links)
- Preemptive type checking (Q1994367) (← links)
- On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions (Q2798773) (← links)
- Friends with Benefits (Q2988636) (← links)
- A Note on Negative Tagging for Least Fixed-Point Formulae (Q4943549) (← links)
- Specification and verification for semi-structured data (Q5291135) (← links)