Skip to search formSkip to main contentSkip to account menu

Nondeterministic programming

Known as: Non-deterministic programming, Nondeterministic program, Nondeterministic language 
A nondeterministic programming language is a language which can specify, at certain points in the program (called "choice points"), various… 
Wikipedia (opens in a new tab)

Related topics

Related topics

19 relations
AdaAutomata-based programmingBacktrackingCall-with-current-continuation

Broader (1)

Computer programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
Veriflcation and Simulation of protocols in the declarative paradigm
The Concurrent Constraint Paradigm (ccp, Saraswat 1993) is a powerful model based on the notion of store-as-constraint instead of… 
2008
2008
Four Non-Deterministic Programming Exercises
In this article, we present four simple exercises that use non-determinism in the context of standard PASCAL-type programs. All… 
2008
2008
Closures of May and Must Convergence for Contextual Equivalence
We show on an abstract level that contextual equivalence in non-deterministic program calculi defined by mayand must-convergence… 
2007
2007
The Kiel Esterel processor: a multi-threaded reactive processor
Many embedded systems belong to the class of reactive systems, which continuously react to inputs from the environment by… 
2006
2006
Testing & Debugging Multi-Agent Systems: A State of the Art Report
Current research and development of agent-based systems has focused primarily on architectures, protocols, frameworks, messaging… 
2003
2003
EÆcient \reversibility" with guards and choice
We describe reversibility mechanisms incorporated into a native code Forth used an an intermediate language for a B-GSL compiler… 
2002
2002
DOCTEUR DE L’ÉCOLE POLYTECHNIQUE EN INFORMATIQUE
operators To verify Aμ-formulas, we need to abstract the operators. For each p in Π, let π(p) be an element of P ] such that π(p… 
1982
1982
Problem of identity transformations of nondeterministic program shcemes in algorithmic algebra systems
Ever-increasing attention to the investigation of nondeterministic processes that generalize deterministic processes because of… 
1975
1975
LINGOL-A Progress Report
the information in the two components is duplicated In fact, he can omit the generative component entirely and put everything in… 
1967
1967
Non-deterministic programming
This paper presents some results of R. W. Floyd (1966). He proposes inclusion of additional features in present programming… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)