Pages that link to "Item:Q796298"
From MaRDI portal
The following pages link to A linear-history semantics for languages for distributed programming (Q796298):
Displaying 15 items.
- Step failures semantics and a complete proof system (Q582133) (← links)
- Communicating processes with value-passing and assignments (Q688827) (← links)
- A weakest precondition semantics for communicating processes (Q789174) (← links)
- A denotational semantics for shared-memory parallelism and nondeterminism (Q792754) (← links)
- Denotational semantics of CSP (Q801677) (← links)
- A complete axiomatic semantics of spawning (Q808281) (← links)
- On the suitability of trace semantics for modular proofs of communicating processes (Q1060004) (← links)
- Specification-oriented semantics for communicating processes (Q1060838) (← links)
- Merging regular processes by means of fixed-point theory (Q1082070) (← links)
- Infinite streams and finite observations in the semantics of uniform concurrency (Q1091800) (← links)
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency (Q1107303) (← links)
- Stable families of behavioural equivalences (Q1119013) (← links)
- Compositional semantics for real-time distributed computing (Q1119027) (← links)
- Correctness of concurrent processes (Q1176236) (← links)
- From algebra to operational semantics (Q1209325) (← links)
