Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Recursive assertions and parallel programs

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

DOI10.1007/BF00289262zbMath0436.68009MaRDI QIDQ1140981

Krzysztof R. Apt

Publication date: 1981

Published in: Acta Informatica (Search for Journal in Brave)


zbMATH Keywords

parallel programsrecursive assertions


Mathematics Subject Classification ID

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


Related Items (7)

On the programs-as-formulas interpretation of parallel programs in Peano arithmetic ⋮ Transition systems, metric spaces and ready sets in the semantics of uniform concurrency ⋮ Designing equivalent semantic models for process creation ⋮ A generalization of Owicki-Gries's Hoare logic for a concurrent while language ⋮ The Rely-Guarantee method for verifying shared variable concurrent programs ⋮ Towards a foundation for semantics in complete metric spaces ⋮ Proving partial order properties



Cites Work

  • Recursive assertions are not enough - or are they?
  • Soundness and Completeness of an Axiom System for Program Verification
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Recursive assertions and parallel programs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1140981&oldid=13194471"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 03:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki