The following pages link to ProofPower (Q18467):
Displaying 19 items.
- On definitions of constants and types in HOL (Q287358) (← links)
- Mechanised support for sound refinement tactics (Q432151) (← links)
- Mechanical reasoning about families of UTP theories (Q436368) (← links)
- Refinement-oriented models of Stateflow charts (Q436420) (← links)
- A tactic language for refinement of state-rich concurrent specifications (Q541214) (← links)
- From control law diagrams to Ada via \textsf{Circus} (Q640296) (← links)
- Automating Event-B invariant proofs by rippling and proof patching (Q667526) (← links)
- Test-data generation for control coverage by proof (Q736805) (← links)
- Using formal reasoning on a model of tasks for FreeRTOS (Q903515) (← links)
- Denotational semantics and its algebraic derivation for an event-driven system-level language (Q903516) (← links)
- A process algebraic framework for specification and validation of real-time systems (Q968306) (← links)
- A timeband framework for modelling real-time systems (Q987537) (← links)
- A UTP semantics for \textsf{Circus} (Q1019016) (← links)
- A consistent foundation for Isabelle/HOL (Q1739913) (← links)
- Angelic processes for CSP via the UTP (Q1757156) (← links)
- A UTP semantics for communicating processes with shared variables and its formal encoding in PVS (Q1798665) (← links)
- Unifying theories in ProofPower-Z (Q1941892) (← links)
- A verified proof checker for higher-order logic (Q1987736) (← links)
- Theoretical and practical approaches to the denotational semantics for MDESL based on UTP (Q2198135) (← links)
