scientific article; zbMATH DE number 3660783

Cited in

(29)

Non-deterministic data types: Models and implementations
The weakest prespecification
A categorical treatment of pre- and post-conditions
Dynamic program slicing
Formalization in program development
Multi-relations in Z. A cross between multi-sets and binary relations
A proof rule for while loop in VDM
Normal form approach to compiler design
Refinement of events in the development of real-time distributed systems
The formal specification of abstract data types and their implementation in Fortran 90
A logic for the stepwise development of reactive systems
Schedulers and finishers: on generating and filtering the behaviours of an event structure
A logical framework for evolving software systems
Compositional verification of real-time systems with explicit clock temporal logic
Programming from Galois connections
Assembling a prehistory for formal methods: a personal view
Possible values: exploring a concept for concurrency
Ours Is to Reason Why
On formal and cognitive semantics for semantic computing
Program development by inductive stepwise refinement
Prespecification in data refinement
Blaming the client: on data refinement in the presence of pointers
Extending rely-guarantee thinking to handle real-time scheduling
Relation-algebraic verification of disjoint-set forests
Purely Functional, Simple, and Efficient Implementation of Prim and Dijkstra
Priority Search Trees
A logic covering undefinedness in program proofs
Balancing expressiveness in formal approaches to concurrency
A reification calculus for model-oriented software specification

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3859249)