Pages that link to "Item:Q1341758"
From MaRDI portal
The following pages link to Fully abstract denotational models for nonuniform concurrent languages (Q1341758):
Displaying 18 items.
- Fully abstract models and refinements as tools to compare agents in timed coordination languages (Q1004066) (← links)
- Semantic models for concurrent logic languages (Q1177921) (← links)
- The semantics of the combination of atomized statements and parallel choice (Q1267037) (← links)
- Full abstractness for a functional/concurrent language with higher-order value-passing (Q1271466) (← links)
- Denotational models for programming languages: Applications of Banach's fixed point theorem (Q1295293) (← links)
- Rendez-vous with metric semantics (Q1313370) (← links)
- Fully abstract semantics for observably sequential languages (Q1327401) (← links)
- Full abstraction and recursion (Q1365671) (← links)
- Strong fairness and full abstraction for communicating processes (Q1854396) (← links)
- Full abstraction for a shared-variable parallel language (Q1923100) (← links)
- Weak bisimulation is sound and complete for pCTL\(^*\) (Q2266992) (← links)
- CPO models for compact GSOS languages (Q2506486) (← links)
- (Q3975156) (← links)
- (Q4040912) (← links)
- (Q4490718) (← links)
- (Q4499206) (← links)
- Full Abstraction for Linda (Q5458387) (← links)
- A fully abstract denotational model for observational precongruence (Q5940916) (← links)