scientific article

zbMath0603.68009MaRDI QIDQ3740201

Jifeng He, C. A. R. Hoare

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

formal methodssoftware engineeringprogram developmentgeneral recursionweakest prespecificationDijkstra's calculus of weakest preconditions

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items

Relation-algebraic semantics, Generalised rely-guarantee concurrency: an algebraic foundation, Parallel constructions of maximal path sets and applications to short superstrings, Dynamic logic with program specifications and its relational proof system, Towards reasoning about Hoare relations, Jifeng He at Oxford and beyond: an appreciation, Data refinement of predicate transformers, Infinitary action logic: complexity, models and grammars, Algebraic proofs of consistency and completeness, On the lattice of specifications: Applications to a specification methodology, The weakest specifunction, A formal software development approach using refinement calculus, Datatype-generic termination proofs, RALL: Machine-supported proofs for relation algebra, Joining specification statements, Extensions of Lambek Calculi, A Labelled Deductive System for Relational Semantics of the Lambek Calculus, Nondeterministic semantics of compound diagrams