The following pages link to (Q4745241):
Displaying 14 items.
- A temporal logic approach to discrete event control for the safety canonical class (Q671584) (← links)
- On using temporal logic for refinement and compositional verification of concurrent systems (Q674008) (← links)
- ``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs (Q689297) (← links)
- On the strength of temporal proofs (Q809066) (← links)
- Verification of multiprocess probabilistic protocols (Q1079944) (← links)
- Proving entailment between conceptual state specifications (Q1095649) (← links)
- The power of temporal proofs (Q1118578) (← links)
- Completing the temporal picture (Q1176248) (← links)
- The \({\mathcal NU}\) system as a development system for concurrent programs: \(\delta{\mathcal NU}\) (Q1190479) (← links)
- Transformation of programs for fault-tolerance (Q1201297) (← links)
- A principle for sequential reasoning about distributed algorithms (Q1346611) (← links)
- Real-time refinement in Manna and Pnueli's temporal logic (Q1815342) (← links)
- The temporal boolean derivative applied to verification of extended finite state machines (Q1903776) (← links)
- A structured temporal logic language: XYZ/SE (Q2277863) (← links)
