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

Correctness proofs of CSP programs

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

DOI10.1016/0304-3975(83)90045-2zbMath0511.68007OpenAlexW2038289817MaRDI QIDQ1838826

N. Soundararajan

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90045-2


zbMATH Keywords

axiomatic semanticscommunicating sequential processes


Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)


Related Items

P-A logic - a compositional proof system for distributed programs



Cites Work

  • Axiomatic semantics of communicating sequential processes
  • A Proof System for Communicating Sequential Processes
  • Communicating sequential processes
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1838826&oldid=14215084"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:33.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki