ACM Transactions on Computational Logic (TOCL)
Adequacy for Algebraic Effects
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Model Checking Algol-Like Languages Using Game Semantics
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
The regular-language semantics of second-order idealized ALGOL
Theoretical Computer Science
A survey of semantic description frameworks for programming languages
ACM SIGPLAN Notices
A game semantics of the asynchronous π-calculus
CONCUR 2005 - Concurrency Theory
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Sequentiality in Bounded Biorders
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Definability and Full Abstraction
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Dually nondeterministic functions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Non-Interference for Deterministic Interactive Programs
Formal Aspects in Security and Trust
Electronic Notes in Theoretical Computer Science (ENTCS)
Nondeterminism and observable sequentiality
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
A compositional method for deciding equivalence and termination of nondeterministic programs
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Probabilistic coherence spaces as a model of higher-order probabilistic computation
Information and Computation
Estimation of the length of interactions in arena game semantics
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Constructing differential categories and deconstructing categories of games
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Game semantics for higher-order concurrency
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Bidomains and full abstraction for countable nondeterminism
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Universality results for models in locally boolean domains
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Data-abstraction refinement: a game semantic approach
SAS'05 Proceedings of the 12th international conference on Static Analysis
Sequentiality in Bounded Biorders
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Constructing differential categories and deconstructing categories of games
Information and Computation
| Hi-index | 0.00 |
A game semantics of finite nondeterminism is proposed. In this model, a strategy may make a choice between different moves in a given situation; moreover, strategies carry extra information about their possible divergent behaviour. A Cartesian closed category is built and a model of a simple, higher-order nondeterministic imperative language is given. This model is shown to be fully abstract, with respect to an equivalence based on both safety and liveness properties, by means of a factorization theorem which states that every nondeterministic strategy is the composite of a deterministic strategy with a nondeterministic oracle.