scientific article
From MaRDI portal
Publication:3995530
zbMath0625.68017MaRDI QIDQ3995530
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
denotational semanticsinductive methodsHoare calculuscomplete partial orderssemantics of programming languagesinductive assertionsverification methodslogic for computable functionsFloyd's inductive assertion methodHoare's axiomatic methodwell founded sets
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (23)
Algebras of modal operators and partial correctness ⋮ The verification of modules ⋮ Termination, deadlock and divergence ⋮ Indexed and fibered structures for partial and total correctness assertions ⋮ Stability, sequentiality and demand driven evaluation in dataflow ⋮ Specification and verification of object-oriented programs using supertype abstraction ⋮ Inductive assertion method for logic pograms ⋮ \textit{Theorema}: Towards computer-aided mathematical theory exploration ⋮ First order data types and first order logic ⋮ On invariant checking ⋮ A Relation-Algebraic Treatment of the Dedekind Recursion Theorem ⋮ Non-terminating processes in the situation calculus ⋮ Equational reasoning about nondeterministic processes ⋮ Term rewriting systems with sort priorities ⋮ Verification conditions for source-level imperative programs ⋮ Improved method to generate path-wise test data ⋮ Design and verification of fault tolerant systems with CSP ⋮ Fifty years of Hoare's logic ⋮ Using computer algebra techniques for the specification, verification and synthesis of recursive programs ⋮ Mechanical Software Verification ⋮ On a generalized product for domains ⋮ Weakly expressive models for Hoare logic ⋮ On the mechanical derivation of loop invariants
This page was built for publication:
