Name
Abstract | ||
|---|---|---|
Branching-time semantics based on domains built upon tree structures have been proposed to model concurrent processes. However, the resulting models imposed severe restrictions to ensure monotonicity and compositionality. To address these issues, we construct a semantic domain without sacrificing these two properties. We also provide a simple and faithful semantics of the Ada rendezvous mechanism |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1109/HICSS.1996.495501 | HICSS (1) |
Keywords | Field | DocType |
computational linguistics,ada rendezvous mechanism,parallel processing,compositionality,trees (mathematics),monotonicity,length n,semantic domain,semantic function,tree-based semantic domain,time semantics,branching time semantics,sets p,uniform language,denotational semantics,semantic issue,tree structures,algebraic domain,model concurrent processes,ada,production,refining,finite element methods,concrete,tree data structures,computer science,tree structure | Principle of compositionality,Monotonic function,Programming language,Semantic domain,Computer science,Tree (data structure),Computational linguistics,Theoretical computer science,Tree structure,Rendezvous,Semantics | Conference |
Volume | ISBN | Citations |
1 | 0-8186-7324-9 | 0 |
PageRank | References | Authors |
0.34 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Boumediene Belkhouche | 1 | 55 | 17.44 |
| R. Raymond Lang | 2 | 0 | 1.35 |
| Chung Wa Ng | 3 | 0 | 0.34 |