The following pages link to (Q3859249):
Displaying 27 items.
- Prespecification in data refinement (Q578901) (← links)
- Blaming the client: on data refinement in the presence of pointers (Q607403) (← links)
- A logic covering undefinedness in program proofs (Q790610) (← links)
- Balancing expressiveness in formal approaches to concurrency (Q890478) (← links)
- A reification calculus for model-oriented software specification (Q911753) (← links)
- Non-deterministic data types: Models and implementations (Q1058286) (← links)
- The weakest prespecification (Q1091121) (← links)
- A categorical treatment of pre- and post-conditions (Q1093363) (← links)
- Dynamic program slicing (Q1110308) (← links)
- Formalization in program development (Q1169283) (← links)
- Multi-relations in Z. A cross between multi-sets and binary relations (Q1186512) (← links)
- A proof rule for while loop in VDM (Q1262115) (← links)
- Normal form approach to compiler design (Q1323320) (← links)
- Refinement of events in the development of real-time distributed systems (Q1341711) (← links)
- The formal specification of abstract data types and their implementation in Fortran 90 (Q1355365) (← links)
- A logic for the stepwise development of reactive systems (Q1786564) (← links)
- Schedulers and finishers: on generating and filtering the behaviours of an event structure (Q1786565) (← links)
- A logical framework for evolving software systems (Q1911313) (← links)
- Compositional verification of real-time systems with explicit clock temporal logic (Q1918934) (← links)
- Programming from Galois connections (Q1931902) (← links)
- Assembling a prehistory for formal methods: a personal view (Q2280210) (← links)
- Possible values: exploring a concept for concurrency (Q2374311) (← links)
- Ours Is to Reason Why (Q2842639) (← links)
- ON FORMAL AND COGNITIVE SEMANTICS FOR SEMANTIC COMPUTING (Q3062792) (← links)
- Program development by inductive stepwise refinement (Q3339257) (← links)
- Extending rely-guarantee thinking to handle real-time scheduling (Q6564175) (← links)
- Relation-algebraic verification of disjoint-set forests (Q6614547) (← links)
