scientific article; zbMATH DE number 3351184
From MaRDI portal
zbMath0221.68020MaRDI QIDQ5626277
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Proof rules for recursive procedures, Stratified least fixpoint logic, Whale: An Interpolation-Based Algorithm for Inter-procedural Verification, Symbolic execution proofs for higher order store programs, Goldilocks and the three specifications, Being and Change: Reasoning About Invariance, Verification conditions are code, Safety and progress of recursive procedures, Traits: correctness-by-construction for free, Resources, concurrency, and local reasoning, Remarks on R. D. Tennent's Language design methods based on semantic principles: Algol 68, a language designed using semantic principles, Flexible Correct-by-Construction Programming, Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II, Axiomatic data type specifications: A first order theory of linear lists, Verification of object-oriented programs: a transformational approach, Command algebras, recursion and program transformation, Floyd's principle, correctness theories and program equivalence, Semantical analysis of specification logic, Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control, Proof obligations for blocks and procedures, A survey of state vectors, Verification conditions for source-level imperative programs, An axiomatic basis for proving total correctness of goto-programs, Translatability of flowcharts into while programs, Incremental reasoning with lazy behavioral subtyping for multiple inheritance, Inference Rules for Proving the Equivalence of Recursive Procedures, Lazy behavioral subtyping, Axiomatic approach to side effects and general jumps, A proof rule for multiple coroutine systems, Language design methods based on semantic principles, Fifty years of Hoare's logic, Formalizing Single-Assignment Program Verification: An Adaptation-Complete Approach, Program invariants as fixedpoints, Hoare's logic and VDM, Semantics of interference control, Wythoff games, continued fractions, cedar trees and Fibonacci searches, Completeness of algorithmic logic, Current methods for proving program correctness, Graph-Based Object-Oriented Hoare Logic, On the notion of expressiveness and the rule of adaptation, A proof outline logic for object-oriented programming, Correctness of programs with Pascal-like procedures without global variables, Calculating sharp adaptation rules., Deductive and inductive synthesis of equational programs, Axiomatic-like performance analysis (ALPA)
