The following pages link to (Q3740201):
Displayed 18 items.
- Nondeterministic semantics of compound diagrams (Q258605) (← links)
- Generalised rely-guarantee concurrency: an algebraic foundation (Q333330) (← links)
- Algebraic proofs of consistency and completeness (Q672320) (← links)
- Infinitary action logic: complexity, models and grammars (Q935019) (← links)
- Datatype-generic termination proofs (Q1015386) (← links)
- Data refinement of predicate transformers (Q1177155) (← links)
- On the lattice of specifications: Applications to a specification methodology (Q1205187) (← links)
- Joining specification statements (Q1285666) (← links)
- Relation-algebraic semantics (Q1350513) (← links)
- Parallel constructions of maximal path sets and applications to short superstrings (Q1366535) (← links)
- Towards reasoning about Hoare relations (Q1924753) (← links)
- The weakest specifunction (Q2484065) (← links)
- A Labelled Deductive System for Relational Semantics of the Lambek Calculus (Q4238425) (← links)
- Dynamic logic with program specifications and its relational proof system (Q4291023) (← links)
- Extensions of Lambek Calculi (Q5014595) (← links)
- RALL: Machine-supported proofs for relation algebra (Q5234720) (← links)
- A formal software development approach using refinement calculus (Q5942699) (← links)
- Jifeng He at Oxford and beyond: an appreciation (Q6118751) (← links)