On the notion of expressiveness and the rule of adaptation
type: Item
instance of: scholarly article
title: On the notion of expressiveness and the rule of adaptation
zbMATH Open document ID: 0511.68006
DOI: 10.1016/0304-3975(83)90009-9
author: Ernst-Rüdiger Olderog
published in: Theoretical Computer Science
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68N01
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 3806912
zbMATH Keywords: completeness of Hoare-like proof systems
zbMATH Keywords: assertion language
zbMATH Keywords: expressiveness
MaRDI profile type: Publication
full work available at URL: 0304-3975(83)90009-9
OpenAlex ID: W2068567986
cites work: Ten Years of Hoare's Logic: A Survey—Part I
cites work: Completeness with Finite Systems of Intermediate Assertions for Recursive Program Schemes
cites work: Q3899466
cites work: Expressiveness and the completeness of Hoare's logic
cites work: The logic of aliasing
cites work: Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
cites work: Soundness and Completeness of an Axiom System for Program Verification
cites work: Programming as a Discipline of Mathematical Nature
cites work: Assignment and Procedure Call Proof Rules
cites work: Q4151142
cites work: An axiomatic basis for computer programming
cites work: Q5626277
cites work: Proof rules for the programming language Euclid
cites work: A simple relation between relational and predicate transformer semantics for nondeterministic programs
cites work: Sound and complete Hoare-like calculi based on copy rules
cites work: Generic commands--a tool for partial correctness formalisms
description: scientific article; zbMATH DE number 3806912