A complete axiomatic semantics of spawning
From MaRDI portal
Publication:808281
Recommendations
- scientific article; zbMATH DE number 3932376
- Towards Complete Reasoning about Axiomatic Specifications
- An axiomatic semantics for nested concurrency
- scientific article; zbMATH DE number 3938560
- An axiomatic semantics for Esterel
- A semantics for every GSPN
- Axiomatic systems in concurrency theory
- The axiomatic semantics of programs based on Hoare's logic
- A denotational semantic theory of concurrent systems
- Axiomatizing schemes and their behaviors
Cites work
- scientific article; zbMATH DE number 3888893 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3723898 (Why is no real title available?)
- scientific article; zbMATH DE number 1142323 (Why is no real title available?)
- A Proof System for Communicating Sequential Processes
- A linear-history semantics for languages for distributed programming
- A mathematical approach to nondeterminism in data types
- A proof system for concurrent ADA programs
- A proof technique for communicating sequential processes
- A proof technique for parallel programs
- An axiomatic basis for computer programming
- An axiomatic semantics for nested concurrency
- Communicating sequential processes
- Designing equivalent semantic models for process creation
- Partial correctness of exits from concurrent structures
- Program proving: KJumps and functions
- Proof rules for the programming language Euclid
- Remarks on 'Program proving: Jumps and functions' by M. Clint and C.A.R. Hoare
- Soundness and Completeness of an Axiom System for Program Verification
- Ten Years of Hoare's Logic: A Survey—Part I
- Using message passing for distributed programming: proof rules and disciplines
This page was built for publication: A complete axiomatic semantics of spawning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808281)