The following pages link to Frank Zeyda (Q432149):
Displaying 22 items.
- Mechanised support for sound refinement tactics (Q432151) (← links)
- Mechanical reasoning about families of UTP theories (Q436368) (← links)
- A tactic language for refinement of state-rich concurrent specifications (Q541214) (← links)
- Unifying theories of time with generalised reactive processes (Q1708268) (← links)
- A unification of probabilistic choice within a design-based model of reversible computation (Q1941891) (← links)
- Unifying theories of reactive design contracts (Q2007732) (← links)
- BGSL: an imperative language for specification and refinement of backtracking programs (Q2096419) (← links)
- Laws of mission-based programming (Q2355382) (← links)
- Safety-critical Java programs from \textsf{Circus} models (Q2443940) (← links)
- Isabelle/UTP: A Mechanised Theory Engineering Framework (Q2814613) (← links)
- An Axiomatic Value Model for Isabelle/UTP (Q2971180) (← links)
- Automating Refinement of Circus Programs (Q2999326) (← links)
- Unifying Heterogeneous State-Spaces with Lenses (Q3179407) (← links)
- Higher-Order UTP for a Theory of Methods (Q3455652) (← links)
- Encoding Circus Programs in ProofPowerZ (Q3585033) (← links)
- Preference and Non-deterministic Choice (Q3585048) (← links)
- (Q4436968) (← links)
- Mechanical Reasoning about Families of UTP Theories (Q5179366) (← links)
- A Design-Based Model of Reversible Computation (Q5307475) (← links)
- ZB 2005: Formal Specification and Development in Z and B (Q5703803) (← links)
- UTP, \textsf{\textit{Circus}}, and Isabelle (Q6535825) (← links)
- Bunch theory: axioms, logic, applications and model (Q6561347) (← links)
