Filters








2,716 Hits in 1.9 sec

Semantics of unbounded nondeterminism [chapter]

Ralph-Johan Back
1980 Lecture Notes in Computer Science  
It is shown that the simple approach of taking the powerdomain of the flat cpo does not produce a correct semantics for programs in which nondeterminism is unbounded.  ...  The powerdomain approach is then extended to computation paths, resulting is an essentially operational semantics for programs of unbounded nondeterminism.  ...  This provides a richer structure, in which it is possible to give the correct semantics of unbounded nondeterminism.  ... 
doi:10.1007/3-540-10003-2_59 fatcat:c5jk5e4vw5dl5p3s5wssbkqmmi

Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism [article]

James Laird
2021 arXiv   pre-print
We prove that these are computationally adequate, despite the non-continuity of the must-testing semantics of unbounded nondeterminism.  ...  We illustrate by defining may-testing and must-testing denotational semantics for sequential functional languages with bounded and unbounded choice operators.  ...  As a continuous semantics, it does not capture programs with unbounded nondeterminism. Intensional Semantics for Non-determinism.  ... 
arXiv:1710.10203v5 fatcat:cbk6thas6bb6rlitwlcg7rbrbu

Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism

James Laird
2021 Logical Methods in Computer Science  
We prove that these are computationally adequate, despite the non-continuity of the must-testing semantics of unbounded nondeterminism.  ...  We illustrate by defining may-testing and must-testing denotational semantics for sequential functional languages with bounded and unbounded choice operators.  ...  definable elements in the must testing semantics of unbounded nondeterminism, leading to a proof that it is not fully abstract.  ... 
doi:10.46298/lmcs-17(4:11)2021 fatcat:tpcwjedbm5bajhlg5hvllbgnfi

Unbounded nondeterminism in CSP [chapter]

A. W. Roscoe, Geoff Barrett
Lecture Notes in Computer Science  
We have two proofs of this result, one via a congruence theorem with operational semantics and one via a careful analysis of operators' behaviour on a subset of the model.  ...  This allows us to give a denotational semantics for a version of CSP including general nondeterministic choice and infinite hiding.  ...  Acknowledgements Stephen Blarney has put a tot of work into analysing, refining and understanding the axioms for U.  ... 
doi:10.1007/bfb0040257 dblp:conf/mfps/RoscoeB89 fatcat:lmwz2guhhfcl7pe67kfjd6zfpy

Denotational models for unblunded nondeterminism

1995 Theoretical Computer Science  
Michael Mislove Denotational models for unbounded nondeterminism http://uuu.elsevier.nl/locate/entcs/volumel/mislove Unbounded nondeterminism has played a fundamental role in the areas of refinement between  ...  Unlike bounded nondeterminism, unbounded nondeterminism has not been amenable to a satisfactory treatment using, for instance, the techniques of domain theory.  ... 
doi:10.1016/0304-3975(96)80135-6 fatcat:w3rzvhamxfd2pc3aqkwwxz2no4

Concurrent semantic for the pi-calculus

1995 Theoretical Computer Science  
Michael Mislove Denotational models for unbounded nondeterminism http://uuu.elsevier.nl/locate/entcs/volumel/mislove Unbounded nondeterminism has played a fundamental role in the areas of refinement between  ...  Unlike bounded nondeterminism, unbounded nondeterminism has not been amenable to a satisfactory treatment using, for instance, the techniques of domain theory.  ... 
doi:10.1016/0304-3975(96)80137-x fatcat:wpso43mvbveqhpemgw3a3pgz3q

Call-by-name, call-by-value, call-by-need and the linear lambda calculus

1995 Theoretical Computer Science  
Michael Mislove Denotational models for unbounded nondeterminism http://uuu.elsevier.nl/locate/entcs/volumel/mislove Unbounded nondeterminism has played a fundamental role in the areas of refinement between  ...  Unlike bounded nondeterminism, unbounded nondeterminism has not been amenable to a satisfactory treatment using, for instance, the techniques of domain theory.  ... 
doi:10.1016/0304-3975(96)80134-4 fatcat:4ntj5x42wvhwvbgykaxqfko64a

Universality and powerdomains

1995 Theoretical Computer Science  
Michael Mislove Denotational models for unbounded nondeterminism http://uuu.elsevier.nl/locate/entcs/volumel/mislove Unbounded nondeterminism has played a fundamental role in the areas of refinement between  ...  Unlike bounded nondeterminism, unbounded nondeterminism has not been amenable to a satisfactory treatment using, for instance, the techniques of domain theory.  ... 
doi:10.1016/0304-3975(96)80136-8 fatcat:2llbl5whfnbwjpumlyp6cypsn4

Page 5267 of Mathematical Reviews Vol. , Issue 98H [page]

1998 Mathematical Reviews  
Denotational models for unbounded nondeterminism. (English summary ) Mathematical foundations of programming semantics (New Orleans, LA, 1995), 18 pp. (electronic), Electron. Notes Theor Comput.  ...  of fairness Unlike bounded nondeterminism, unbounded nondeterminism has not been amenable to a satisfactory treatment using, for instance, the techniques of domain theory.  ... 

Denotational Models for Unbounded Nondeterminism1 1Work partially supported by the Office of Naval Research

Michael W. Mislove
1995 Electronical Notes in Theoretical Computer Science  
Unlike bounded nondeterminism, unbounded nondeterminism has not been amenable to a satisfactory treatment using, for instance, the techniques of domain theory.  ...  Unbounded nondeterminism has played a fundamental role in the areas of re nement between models of languages supporting real-time constructs and in the treatment o f fairness.  ...  We w ould like t o f o c u s o n USalone as the target category for our semantics of unbounded nondeterminism, but the mappings in the category do not always have least xed points.  ... 
doi:10.1016/s1571-0661(04)00023-4 fatcat:ulafwxxrpvevrgfkxmdywfxrbe

Page 2878 of Mathematical Reviews Vol. , Issue 84g [page]

1984 Mathematical Reviews  
He then defines a continuous denotational semantics for unbounded nondeterminism.  ...  The author shows that the straightforward extension of Plotkin’s semantics to unbounded nondeterminism is not continuous.  ... 

A Network of Communicating Logic Programs and Its Semantics

Susumu Yamasaki
1987 International Joint Conference on Artificial Intelligence  
a given network even when it is of unbounded nondeterminisrn.  ...  The network, then, has a (least) fixpoint semantics; it is regarded as one of mathematical semantics of the network, since it can satisfy the recursive relations among the channels' denotations.  ...  Thus, the denotational semantics of NCLP is well-defined even when it has unbounded nondeterminism. where The operational semantics of NCLP based on its fixpoint semantics was defined in Section 4.  ... 
dblp:conf/ijcai/Yamasaki87 fatcat:wjtieytv7bco5jb4hfjwpzgfm4

A Fully Abstract Game Semantics for Countable Nondeterminism

W. John Gowers, James D. Laird, Michael Wagner
2018 Annual Conference for Computer Science Logic  
The concept of fairness for a concurrent program means that the program must be able to exhibit an unbounded amount of nondeterminism without diverging.  ...  Game semantics models of nondeterminism show that this is hard to implement; for example, Harmer and McCusker's model only admits infinite nondeterminism if there is also the possibility of divergence.  ...  that unbounded nondeterminism lacks.  ... 
doi:10.4230/lipics.csl.2018.24 dblp:conf/csl/GowersL18 fatcat:shxxc4hhd5agboty2qtgdhb7oi

Testing semantics for unbounded nondeterminism [chapter]

Luis Fdo. Llana Díaz, Manuel Núñez
1997 Lecture Notes in Computer Science  
We present an extension of the classical testing semantics for the case when nondeterminism is unbounded. We de ne the corresponding may and must preorders in the new framework.  ...  As in the bounded setting the may preorder can be characterized by using the set of nite traces of processes.  ...  We present a testing semantics for a language supporting unbounded nondeterminism.  ... 
doi:10.1007/bfb0002780 fatcat:vxnt3n6ohbac7olokju5vsbac4

A continuous semantics for unbounded nondeterminism

R.J.R. Back
1983 Theoretical Computer Science  
The paper discllsses the problem of defining a denotational semantic for programming languages with this kind of, possibly unbounded, nondeterminism.  ...  It is shown hoa%uch a continuous semantics for unbounded nondeterminism can be derived from 3 simple operational semantics based on program execution trees.  ...  Semantics of bounded nondeterminism Before going into the construction of a continuous semantics for unbounded nondeterminism, we will briefly describe the way in which a continuous semantics for bounded  ... 
doi:10.1016/0304-3975(83)90055-5 fatcat:ynzzeokdrzagbi5lc3cpspr2fq
« Previous Showing results 1 — 15 out of 2,716 results