Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Proof techniques for hierarchically structured programs

From MaRDI portal
Publication:4130971
Jump to:navigation, search

DOI10.1145/359461.359483zbMATH Open0358.68030OpenAlexW2085818042MaRDI QIDQ4130971FDOQ4130971


Authors:


Publication date: 1977

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359461.359483





Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)



Cited In (6)

  • Final algebra semantics and data type extensions
  • Specifications, models, and implementations of data abstractions
  • Semantic properties of Lucid's compute clause and its compilation
  • Proving programs correct through refinement
  • Operating system verification---an overview
  • A formal methodology using attributed grammars for multiprocessing-system software development. II. Validation





This page was built for publication: Proof techniques for hierarchically structured programs

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4130971&oldid=17921604"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 09:01. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki